Kazhdan–Lusztig coefficient maximality conjecture for uniform matroids
Let be a matroid of rank on elements, and write its Kazhdan–Lusztig polynomial as
Let denote the uniform matroid of rank on elements, and let be the -th coefficient of its Kazhdan–Lusztig polynomial. Kazhdan–Lusztig coefficient maximality conjecture. For every such matroid and every coefficient index ,
Equivalently, among matroids with rank and ground-set size , the uniform matroid has the largest Kazhdan–Lusztig coefficients. The paper proves this conjecture for sparse paving matroids, but the general statement remains open.
References
Primary source
Kyungyong Lee, George D. Nasr and Jamie Radcliffe, “A Combinatorial Formula for Kazhdan-Lusztig Polynomials of Sparse Paving Matroids”, arXiv:2006.10209 (2020).
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
No solutions have been posted yet.