PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 21, 2026Bulletin of the London Mathematical Society0 citations

Log‐concavity of inverse Kazhdan–Lusztig polynomials of paving matroids

View Full Paper
MXMatthew H. Y. XiePZPhilip B. Zhang

Key Points

  • To investigate the log-concavity of inverse Kazhdan-Lusztig polynomials in paving matroids and establish a conjecture.
  • Applied the theory of interlacing polynomials
  • Used properties of multiplier sequences
  • Analyzed Hadamard products of polynomials
  • Confirmed that the Hadamard product of certain inverse Kazhdan-Lusztig polynomials is real-rooted
  • Established the log-concavity of these polynomials for paving matroids using Newton's inequalities

Abstract

Abstract 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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Xie et al. (2026) studied this question.

synapsesocial.com/papers/69706d13b6488063ad5c1c8ahttps://doi.org/10.1112/blms.70264
Ask AI
Helpful
Bookmark
Share
View Full Paper