The superexponential coefficient-growth conjecture for Kazhdan–Lusztig polynomials

About 2 years old · traced to

For w∈Snw\in\mathrm{S}_{n}, let Pw\mathrm{P}_{w} be the first-row Kazhdan–Lusztig polynomial, and let coeffn\mathrm{coeff}_{n} denote the maximal coefficient among these polynomials; let evn\mathrm{ev}_{n} denote the corresponding maximal value at v=1\mathtt{v}=1. Superexponential coefficient-growth conjecture.

coeffn∈Ω(γn)for all γ∈R>1.\mathrm{coeff}_{n}\in\Omega(\gamma^{n})\quad\text{for all }\gamma\in\mathbb{R}_{>1}.

Since evn≥coeffn\mathrm{ev}_{n}\geq\mathrm{coeff}_{n}, the same superexponential lower bound is asserted for evn\mathrm{ev}_{n}. The evidence is computational, and the conjecture concerns the asymptotic growth of the largest coefficients and evaluations.

References

Primary source

Abel Lacabanne, Daniel Tubbenhauer and Pedro Vaz, “Big data approach to Kazhdan-Lusztig polynomials”, arXiv:2412.01283 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.