The superexponential coefficient-growth conjecture for Kazhdan–Lusztig polynomials
The superexponential coefficient-growth conjecture for Kazhdan–Lusztig polynomials
For , let be the first-row Kazhdan–Lusztig polynomial, and let denote the maximal coefficient among these polynomials; let denote the corresponding maximal value at . Superexponential coefficient-growth conjecture.
Since , the same superexponential lower bound is asserted for . The evidence is computational, and the conjecture concerns the asymptotic growth of the largest coefficients and evaluations.
Sources & referencesView supporting material
Primary source
Abel Lacabanne, Daniel Tubbenhauer and Pedro Vaz, “Big data approach to Kazhdan-Lusztig polynomials”, arXiv:2412.01283 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.