Kazhdan–Lusztig coefficient maximality conjecture for uniform matroids

Let MM be a matroid of rank dd on m+dm+d elements, and write its Kazhdan–Lusztig polynomial as

PM(t)=iciti.P_M(t)=\sum_i c^i t^i.

Let Um,dU_{m,d} denote the uniform matroid of rank dd on m+dm+d elements, and let cm,di()c^i_{m,d}(\emptyset) be the ii-th coefficient of its Kazhdan–Lusztig polynomial. Kazhdan–Lusztig coefficient maximality conjecture. For every such matroid MM and every coefficient index ii,

cicm,di().c^i\leq c^i_{m,d}(\emptyset).

Equivalently, among matroids with rank dd and ground-set size m+dm+d, the uniform matroid has the largest Kazhdan–Lusztig coefficients. The paper proves this conjecture for sparse paving matroids, but the general statement remains open.

Sources & referencesView supporting material

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

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.