惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

量子位
D
DataBreaches.Net
Microsoft Security Blog
Microsoft Security Blog
V
Visual Studio Blog
GbyAI
GbyAI
美团技术团队
云风的 BLOG
云风的 BLOG
大猫的无限游戏
大猫的无限游戏
小众软件
小众软件
博客园 - 叶小钗
Engineering at Meta
Engineering at Meta
博客园 - 三生石上(FineUI控件)
N
Netflix TechBlog - Medium
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
G
Google Developers Blog
博客园 - 【当耐特】
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
宝玉的分享
宝玉的分享
阮一峰的网络日志
阮一峰的网络日志
T
The Blog of Author Tim Ferriss
Y
Y Combinator Blog
U
Unit 42
P
Proofpoint News Feed
V
V2EX

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Kazhdan-Lusztig Basis and Optimization
Tom Goertzen, Geordie Williamson · 2026-04-21 · via math.CO updates on arXiv.org

We describe a conjectural approach to obtaining canonical bases of the Hecke algebra at $q=1$ via continuous quadratic optimization. We focus on Specht modules $S^λ$ and proper cones inside $S^λ$ that are invariant under the action of $1+s$ for all simple reflections $s\in S$. We show that there are unique minimal and maximal cones invariant under all $1+s$. For hook shapes, two-column shapes, and partitions of the form $(n-2,2)$, we prove that the Kazhdan--Lusztig basis spans this maximal cone. More generally, we define an optimization problem over bases that are unitriangular with respect to the polytabloid basis, subject to the constraint that the operators $1+s$ act non-negatively. We prove that the feasible region forms a compact semialgebraic set, and interpret it in terms of a hierarchy of invariant cones under all $1+s$. We demonstrate that minimizing the trace of the Gram matrix uniquely recovers Young's seminormal basis. Furthermore, we verify computationally that maximization uniquely recovers the Kazhdan--Lusztig basis for all partitions of $n\leq 7$. In higher ranks, the optimization detects deviations from the Kazhdan--Lusztig basis and may favour other natural positive bases, such as the Springer basis or $p$-canonical bases. Finally, we extend this framework to irreducible representations of $\mathfrak{sl}_n$. We observe that the Gelfand--Tsetlin basis corresponds to the unique minimizer, and we conjecture that the canonical basis corresponds to the maximum in small ranks.