Answers are grounded in this paper and cite their sources.
Mathematical analysis confirms log-concavity of polynomials in paving matroids, suggesting new insights into combinatorial properties.
Gao and Xie conjectured that the inverse Kazhdan–Lusztig polynomial of any matroid is log‐concave. Although these polynomials are not necessarily real‐rooted, we conjecture that the Hadamard product of an inverse Kazhdan–Lusztig polynomial of degree with is real‐rooted. Using the theory of interlacing polynomials and multiplier sequences, we confirm this conjecture for paving matroids. As a consequence, the log‐concavity of inverse Kazhdan–Lusztig polynomials for paving matroids follows from Newton's inequalities.
No takes yet. Share an insight, caveat, or question.
Xie et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: