Hoggatt polynomials

The Hoggatt polynomials interpolate between the binomial polynomials, the Narayana polynomials and the descent polynomials of Baxter permutations. For each $m\ge2$ they form a Sturm sequence with simple negative roots.

Results

For $N\ge0$ and $m\ge1$ let $$ F_{N,m}(t)=\sum_{k\ge0}\Bigl(\prod_{i=0}^{m-1}\binom{N}{k+i}\Bigr)t^k , $$ and for $n\ge1$ define the Hoggatt polynomial $H_n^{[m]}(t)=F_{n+m-2,m}(t)/F_{n+m-2,m}(0)$, which has degree $n-1$ and constant term $1$. By MacMahon's formula, the coefficient of $t^k$ counts plane partitions in a $k\times(n-1-k)\times m$ box. For $m=1$ we get $(1+t)^{n-1}$, for $m=2$ the Narayana polynomials $\sum_k\frac1n\binom nk\binom n{k+1}t^k$, and for $m=3$ the descent polynomials of Baxter permutations of length $n$, which are the rows of OEIS A056939.

Theorem (Fang–Zhang–Zhao). [FZZ25] Let $m\ge2$. For every $n\ge1$, the roots of $H_n^{[m]}$ are simple and negative, $H_n^{[m]}\ll H_{n+1}^{[m]}$, and the two polynomials have no common root.

Corollary (Dilks). [Dil15] For every $m\ge1$ and $n\ge1$, $H_n^{[m]}$ is real-rooted.

In particular, consecutive Baxter descent polynomials strictly interlace.

Proof

Write $*$ for the coefficientwise (Hadamard) product. Comparing coefficients gives $$ \frac{d}{dt}\bigl(F_{N+1,1}*F_{N,m}\bigr)=(N+1)\,F_{N,m+1}. $$ Induction on $m$, with the Garloff–Wagner theorem for Hadamard products and derivative interlacing, gives real roots and weak interlacing. For strictness, the same identity together with simplicity of the roots of Hadamard products rules out common roots of Hadamard products with consecutive binomial powers, and positivity of the Wronskian gives Markov's strict form of the derivative step.

References

  1. [FZZ25] Hanqian Fang, Candice X. T. Zhang, & James J. Y. Zhao. Analytic properties arising from the Baxter numbers. arXiv e-prints, 2025.
    BibTeX
    @article{FangZhangZhao2025x,
      author = {Hanqian Fang and Candice X. T. Zhang and James J. Y. Zhao},
      title = {Analytic properties arising from the {B}axter numbers},
      year = {2025},
      eprint = {2505.05873v1},
      url = {https://arxiv.org/abs/2505.05873v1},
      journal = {arXiv e-prints}
    }
  2. [Dil15] Kevin Dilks. Involutions on Baxter Objects, and $q$-Gamma Nonnegativity. 2015.
    BibTeX
    @phdthesis{Dilks2015Thesis,
      author = {Kevin Dilks},
      title = {Involutions on {B}axter Objects, and $q$-Gamma Nonnegativity},
      school = {University of Minnesota},
      type = {PhD Thesis},
      year = {2015},
      url = {https://hdl.handle.net/11299/182835}
    }

Definitions

  • The binomial-product polynomial F(n,m)

    RealRooted.Hoggatt.polynomialsource
    def polynomial (n m : ℕ) : ℝ[X] :=
      ∑ k ∈ range (n + 1), monomial k (∏ i ∈ range m, (n.choose (k + i) : ℝ))
  • Normalized Hoggatt polynomials H_n^[m]

    RealRooted.Hoggatt.normalizedsource
    def normalized (n m : ℕ) : ℝ[X] :=
      C ((polynomial (n + m - 2) m).coeff 0)⁻¹ * polynomial (n + m - 2) m

Theorems

  • For every m ≥ 2, consecutive Hoggatt rows strictly interlaceMain result

    RealRooted.Hoggatt.normalized_interlaces_and_isCoprimesource
    theorem normalized_interlaces_and_isCoprime {n m : ℕ} (hn : n ≠ 0) (hm : 2 ≤ m) :
        Interlaces (normalized n m) (normalized (n + 1) m) ∧
          IsCoprime (normalized n m) (normalized (n + 1) m)
  • F(n−1,m) strictly interlaces F(n,m) for n ≥ m ≥ 2

    RealRooted.Hoggatt.polynomial_pred_interlacessource
    theorem polynomial_pred_interlaces {n m : ℕ} (hm : 2 ≤ m) (hn : m ≤ n) :
        Interlaces (polynomial (n - 1) m) (polynomial n m) ∧
          IsCoprime (polynomial (n - 1) m) (polynomial n m)
  • The Hadamard derivative identity G'(n+1,m+1) = (n+1) F(n,m+1)

    RealRooted.Hoggatt.derivative_binomialHadamardsource
    theorem derivative_binomialHadamard (n : ℕ) {m : ℕ} (hm : m ≠ 0) :
        (binomialHadamard n m).derivative = C ((n : ℝ) + 1) * polynomial n (m + 1)
  • The derivative identity at m = 2

    RealRooted.Hoggatt.derivative_hadamard_onesource
    theorem derivative_hadamard_one (n : ℕ) :
        (hadamardProduct (polynomial n 1) (polynomial (n + 1) 1)).derivative =
          C ((n : ℝ) + 1) * polynomial n 2
  • Every Hoggatt polynomial is real-rooted, for all m ≥ 1

    RealRooted.Hoggatt.normalized_splitssource
    theorem normalized_splits {n m : ℕ} (hn : n ≠ 0) (hm : m ≠ 0) :
        (normalized n m).Splits
  • The m = 1 family consists of powers of X + 1

    RealRooted.Hoggatt.normalized_onesource
    theorem normalized_one (n : ℕ) :
        normalized n 1 = (X + 1) ^ (n - 1)
  • The binomial-product polynomials have simple roots for m ≥ 2

    RealRooted.Hoggatt.hasSimpleRoots_polynomialsource
    theorem hasSimpleRoots_polynomial {n m : ℕ} (hm : 2 ≤ m) (hn : m ≤ n + 1) :
        HasSimpleRoots (polynomial n m)
  • Baxter polynomials are a strict Sturm sequence

    RealRooted.Hoggatt.baxter_interlacessource
    theorem baxter_interlaces {n : ℕ} (hn : n ≠ 0) :
        Interlaces (normalized n 3) (normalized (n + 1) 3) ∧
          IsCoprime (normalized n 3) (normalized (n + 1) 3)
  • For m = 3, the Hoggatt polynomials are the Baxter descent polynomials (A056939)

    RealRooted.Hoggatt.normalized_three_eq_baxtersource
    theorem _root_.RealRooted.Hoggatt.normalized_three_eq_baxter (n : ℕ) :
        Hoggatt.normalized (n + 1) 3 = polynomial n
  • Consecutive Baxter descent polynomials are coprime

    RealRooted.Applications.OEIS.A056939.polynomial_isCoprime_succsource
    theorem polynomial_isCoprime_succ (n : ℕ) :
        IsCoprime (polynomial n) (polynomial (n + 1))

Lean source RealRooted/Challenges/Combinatorial/Hoggatt.lean at revision d6670742. Formalized 2026-11-13.