Kazhdan-Lusztig polynomials of matroids under deletion
Tom Braden, Artem Vysogorets

TL;DR
This paper derives a formula connecting the Kazhdan-Lusztig polynomial of a matroid to those of related matroids obtained by deletion, contraction, and localization, with applications to graphic matroids.
Contribution
It introduces a new formula relating Kazhdan-Lusztig polynomials of matroids under deletion and other operations, expanding understanding of their combinatorial properties.
Findings
Derived a formula linking Kazhdan-Lusztig polynomials of matroids and their deletions
Applied the formula to compute polynomials for graphic matroids
Provided a simple formula for parallel connection graphs
Abstract
We present a formula which relates the Kazhdan-Lusztig polynomial of a matroid , as defined by Elias, Proudfoot and Wakefield, to the Kazhdan--Lusztig polynomials of the matroid obtained by deleting an element, and various contractions and localizations of . We give a number of applications of our formula to Kazhdan--Lusztig polynomials of graphic matroids, including a simple formula for the Kazhdan--Lusztig polynomial of a parallel connection graph.
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.
