Jacobi–Stirling descent polynomials

The Jacobi–Stirling descent polynomials $A_{k,i}$ are real-rooted for $i\in\{1,2,3,k-2,k-1\}$.

Results

Gessel, Lin and Zeng studied Jacobi–Stirling permutations: permutations of the multiset $M_k=\{\bar1,1,1,\bar2,2,2,\dotsc,\bar k,k,k\}$ with a Stirling-type pattern condition. For $S\subseteq[k]$, let $A_{k,S}(x)$ count the Jacobi–Stirling permutations of $M_k\setminus\{\bar s:s\in S\}$ by descents, and let $A_{k,i}=\sum_{|S|=i}A_{k,S}$. They conjectured that every $A_{k,i}$ is real-rooted [GLZ12, Conj. 15].

We define $A_{k,S}$ by the insertion recurrences $A_{0,S}=1$, $$ A_{k,S}=D_L\,A_{k-1,S\setminus\{k\}}\quad(k\in S),\qquad A_{k,S}=D_{L+1}D_L\,A_{k-1,S}\quad(k\notin S), $$ with $L=3(k-1)-|S\cap[k-1]|$ and the insertion operator $D_Lf=(1+Lx)f+x(1-x)f'$.

Theorem (Ma–Wang). Let $1\le i\le k$ with $i\in\{1,2,3,k-2,k-1\}$. Every nonzero nonnegative combination $\sum_{|S|=i}c_SA_{k,S}$ has only simple negative roots, all real. In particular $A_{k,i}$ is real-rooted with simple negative roots [MW26, Thm. 2].

Proposition. For $k\ge1$ and $S\subseteq[k]$, $A_{k,S}$ has degree $2k-|S|-1$, constant term $1$, nonnegative coefficients and only simple negative roots. When every barred letter is deleted, $x\,A_{k,[k]}$ is the second-order Eulerian polynomial, the descent polynomial of Stirling permutations.

Proof

Let $f\ll g$ be polynomials with simple negative roots and no common root, with $\deg g=\deg f+1$, and let $L>\deg f$. Then $D_Lf\ll D_{L+1}g$ with no common root, by the identity $g\,D_Lf-f\,D_{L+1}g=-x\,W\bigl(g,(x-1)f\bigr)$ and the positivity of the Wronskian $W(g,(x-1)f)$. An induction on $k$ compares every $A_{k,S}$ with one fixed polynomial, and nonnegative combinations of polynomials that all interlace a common polynomial keep that property.

References

  1. [GLZ12] Ira M. Gessel, Zhicong Lin, & Jiang Zeng. Jacobi--Stirling polynomials and $P$-partitions. European Journal of Combinatorics, 33(8), 1987-2000, 2012.
    BibTeX
    @article{GesselLinZeng2012,
      author = {Gessel, Ira M. and Lin, Zhicong and Zeng, Jiang},
      title = {Jacobi--{S}tirling polynomials and {$P$}-partitions},
      year = {2012},
      journal = {European Journal of Combinatorics},
      volume = {33},
      number = {8},
      pages = {1987--2000},
      doi = {10.1016/j.ejc.2012.06.008},
      eprint = {1201.0622v2},
      url = {https://doi.org/10.1016/j.ejc.2012.06.008}
    }
  2. [MW26] Shi-Mei Ma & Ming-Xin Wang. Binomial expansions of Jacobi-Stirling numbers and real-rootedness of Jacobi-Stirling descent polynomials. arXiv e-prints, 2026.
    BibTeX
    @article{MaWang2026x,
      author = {Shi-Mei Ma and Ming-Xin Wang},
      title = {Binomial expansions of {J}acobi-{S}tirling numbers and real-rootedness of {J}acobi-{S}tirling descent polynomials},
      year = {2026},
      eprint = {2610.03111v1},
      url = {https://arxiv.org/abs/2610.03111v1},
      journal = {arXiv e-prints}
    }

Definitions

  • The insertion operator D_L f = (1 + Lx) f + x(1 - x) f'

    RealRooted.JacobiStirlingDescent.insertionsource
    def insertion (L : ℕ) (f : ℝ[X]) : ℝ[X] :=
      darbouxOperator 1 (-(L : ℝ)) f
  • The descent polynomial A_{k,S}

    RealRooted.JacobiStirlingDescent.descentPolysource
    def descentPoly : ℕ → Finset ℕ → ℝ[X]
      | 0, _ => 1
      | k + 1, S =>
        if k + 1 ∈ S then insertion (3 * k - (S ∩ Finset.Icc 1 k).card)
            (descentPoly k (S ∩ Finset.Icc 1 k))
        else insertion (3 * k - (S ∩ Finset.Icc 1 k).card + 1)
            (insertion (3 * k - (S ∩ Finset.Icc 1 k).card) (descentPoly k (S ∩ Finset.Icc 1 k)))
  • The Jacobi–Stirling descent polynomial A_{k,i}

    RealRooted.JacobiStirlingDescent.descentSumsource
    def descentSum (k i : ℕ) : ℝ[X] :=
      ∑ S ∈ (Finset.Icc 1 k).powersetCard i, descentPoly k S

Theorems

  • For k ≥ 1, A_{k,S} has degree 2k − |S| − 1, constant term 1, simple negative roots

    RealRooted.JacobiStirlingDescent.isGood_descentPolysource
    theorem isGood_descentPoly {k : ℕ} {S : Finset ℕ} (hS : S ⊆ Finset.Icc 1 k) :
        IsGood (descentPoly k S) (2 * k - S.card - 1)
  • If f ≺ g, deg g = deg f + 1 and deg f < L, then D_L f ≺ D_{L+1} g

    RealRooted.JacobiStirlingDescent.StrictInterleave.insertion_succsource
    theorem StrictInterleave.insertion_succ {f g : ℝ[X]} {d L : ℕ} (hfg : StrictInterleave f g)
        (hf : IsGood f d) (hg : IsGood g (d + 1)) (hL : d < L) :
        StrictInterleave (insertion L f) (insertion (L + 1) g)
  • For i ∈ {1, 2, 3, k − 2, k − 1}, nonnegative combinations of A_{k,S} are real-rootedMain result

    RealRooted.JacobiStirlingDescent.weightedDescentSum_splits_simple_negsource
    theorem weightedDescentSum_splits_simple_neg {k i : ℕ}
        (hi : i = 1 ∨ i = 2 ∨ i = 3 ∨ i + 2 = k ∨ i + 1 = k)
        (hc : ∀ S ∈ (Finset.Icc 1 k).powersetCard i, 0 ≤ c S)
        (hpos : ∃ S ∈ (Finset.Icc 1 k).powersetCard i, 0 < c S) :
        (weightedDescentSum k i c).Splits ∧ HasSimpleRoots (weightedDescentSum k i c) ∧
          ∀ r, (weightedDescentSum k i c).IsRoot r → r < 0
  • A_{k,i} is real-rooted for i ∈ {1, 2, 3, k − 2, k − 1}

    RealRooted.JacobiStirlingDescent.descentSum_splits_simple_negsource
    theorem descentSum_splits_simple_neg {k i : ℕ}
        (hi : i = 1 ∨ i = 2 ∨ i = 3 ∨ i + 2 = k ∨ i + 1 = k) (hik : i ≤ k) :
        (descentSum k i).Splits ∧ HasSimpleRoots (descentSum k i) ∧
          ∀ r, (descentSum k i).IsRoot r → r < 0
  • Deleting every barred letter: x A_{k,[k]} is the second-order Eulerian polynomial

    RealRooted.JacobiStirlingDescent.X_mul_descentPoly_Iccsource
    theorem X_mul_descentPoly_Icc (k : ℕ) :
        X * descentPoly (k + 1) (Finset.Icc 1 (k + 1)) = stirlingPermutations (k + 1)

Lean source RealRooted/Challenges/Combinatorial/JacobiStirlingDescent.lean at revision d6670742. Formalized 2026-10-07.