A Combinatorial Formula for Kazhdan-Lusztig Polynomials of Sparse Paving Matroids
Kyungyong Lee, George D. Nasr, Jamie Radcliffe

TL;DR
This paper proves the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids using a new combinatorial formula involving skew Young tableaux, supporting the broader conjecture for all matroids.
Contribution
It introduces a simple combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids, advancing understanding of their positivity.
Findings
Positivity of Kazhdan-Lusztig polynomials for sparse paving matroids established.
New combinatorial formula involving skew Young tableaux derived.
Supports the conjecture that all matroids have non-negative Kazhdan-Lusztig polynomial coefficients.
Abstract
We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple combinatorial formula we discovered for these polynomials using skew young tableaux. This supports the conjecture that Kazhdan-Lusztig polynomials for all matroids have non-negative coeffiecients. In special cases, such as uniform matroids, our formula has a nice combinatorial interpretation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Topological and Geometric Data Analysis · Commutative Algebra and Its Applications
