Real-rootedness of the -polynomials of sparse paving matroids and strict interlacing for uniform matroids
arXiv:2609.07636
Abstract
We prove that the -polynomial of every sparse paving matroid has only negative real zeros, confirming the real-rootedness conjecture of Proudfoot, Xu, and Young for this class. We also prove that, for each fixed positive corank, the -polynomials of uniform matroids in consecutive ranks strictly interlace. Our approach is to prove real-rootedness of the corresponding -polynomials for sparse paving matroids and their strict interlacing for uniform matroids, and then transfer both properties to the corresponding -polynomials.
arXiv comment24 pages