Skip to content
DraconiticResearch
Search Sources API
186,086 studies31 sourcesUpdated 19 min ago
PreprintarXiv licencearXiv

Binomial expansions of Jacobi-Stirling numbers and real-rootedness of Jacobi-Stirling descent polynomials

Abstract

In this paper, we first expand fixed diagonals of the Jacobi-Stirling numbers in a binomial basis. For the second kind, the expansion coefficients are polynomials in z+1 with nonnegative integer coefficients. We give a recurrence and a signed-partition interpretation for these coefficients. The same holds for the differences between corresponding unsigned first-kind and second-kind coefficients. We then prove that every nonzero nonnegative linear combination of the descent polynomials over Jacobi-Stirling permutations with a fixed number of deleted barred letters has only simple negative zeros when that number is one, two, or three. The same holds when exactly one or two barred letters are retained. Thus we verify five infinite families in a conjecture of Gessel, Lin and Zeng. Finally, using insertion operators, we find that every descent polynomial over Jacobi-Stirling permutations with a fixed number of deleted barred letters is top heavy and has an increasing left half.

Related

  1. Some Expressions involving Bernoulli, Harmonic, and Stirling Numbers
    Hongshen Chua
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. The real-rootedness of the toric g-contribution polynomials
    Qiqi Xiao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Real-rootedness of Kazhdan--Lusztig polynomials of sparse paving matroids
    Philip B. Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Weak Hurwitz stability of extended Turán expressions for Stirling--Whitney--Riordan and Laguerre polynomials
    Wenle Shi
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  5. Real-rootedness of the Z-polynomials of sparse paving matroids and strict interlacing for uniform matroids
    Matthew H. Y. Xie, Philip B. Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{ma2026binomial,
  title = {{Binomial expansions of Jacobi-Stirling numbers and real-rootedness of Jacobi-Stirling descent polynomials}},
  author = {Shi-Mei Ma and Ming-Xin Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03111},
  eprint = {2610.03111},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03111},
}
RIS
TY  - UNPB
TI  - Binomial expansions of Jacobi-Stirling numbers and real-rootedness of Jacobi-Stirling descent polynomials
AU  - Shi-Mei Ma
AU  - Ming-Xin Wang
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03111
UR  - https://arxiv.org/abs/2610.03111
AB  - In this paper, we first expand fixed diagonals of the Jacobi-Stirling numbers in a binomial basis. For the second kind, the expansion coefficients are polynomials in z+1 with nonnegative integer coefficients. We give a recurrence and a signed-partition interpretation for these coefficients. The same holds for the differences between corresponding unsigned first-kind and second-kind coefficients. We then prove that every nonzero nonnegative linear combination of the descent polynomials over Jacobi-Stirling permutations with a fixed number of deleted barred letters has only simple negative zeros when that number is one, two, or three. The same holds when exactly one or two barred letters are retained. Thus we verify five infinite families in a conjecture of Gessel, Lin and Zeng. Finally, using insertion operators, we find that every descent polynomial over Jacobi-Stirling permutations with a fixed number of deleted barred letters is top heavy and has an increasing left half.
ER  -