ICANEWS

Binomial Expansions and Real-Rootedness of Jacobi-Stirling Descent Polynomials

arXiv Math · · 3 min read · Natural Sciences

Read research and analysis on Binomial Expansions and Real-Rootedness of Jacobi-Stirling Descent Polynomials published by ICANEWS, a global research journal for emerging researchers.

Key Takeaways

  • Fixed diagonals of second-kind Jacobi-Stirling numbers expand into a binomial basis with coefficients being polynomials in $z+1$ with nonnegative integer values.
  • A recurrence and signed-partition interpretation exist for these expansion coefficients, as well as for differences between first- and second-kind coefficients.
  • Nonzero nonnegative linear combinations of Jacobi-Stirling descent polynomials have only simple negative zeros when 1, 2, or 3 barred letters are deleted, or when 1 or 2 barred letters are retained.
  • Five infinite families in the Gessel, Lin, and Zeng conjecture regarding real-rootedness are verified.
  • Every descent polynomial over Jacobi-Stirling permutations with a fixed number of deleted barred letters is top heavy and has an increasing left half.

Why This Matters

The findings verify five infinite families of a conjecture by Gessel, Lin, and Zeng, contributing to the understanding of real-rootedness in combinatorial polynomials. The characterization of expansion coefficients and structural properties of descent polynomials offers insights into Jacobi-Stirling numbers.

Overview

This research investigates the binomial expansions of Jacobi-Stirling numbers and the real-rootedness properties of Jacobi-Stirling descent polynomials. The study focuses on two main areas: deriving binomial basis expansions for fixed diagonals of Jacobi-Stirling numbers, specifically for the second kind, and examining the real-rootedness of descent polynomials associated with Jacobi-Stirling permutations under particular conditions related to barred letters.

Research Context

The work situates itself within the study of combinatorial numbers and polynomial properties. It addresses a conjecture proposed by Gessel, Lin, and Zeng regarding the real-rootedness of certain polynomials. The analysis involves Jacobi-Stirling numbers, which are combinatorial sequences, and descent polynomials over Jacobi-Stirling permutations. The context implies a focus on enumerative combinatorics and algebraic properties of polynomials.

Approach

The approach involves several distinct analytical steps:

  • Binomial Basis Expansion: The research first expands fixed diagonals of the Jacobi-Stirling numbers of the second kind in a binomial basis.
  • Coefficient Characterization: For these expansions, the coefficients are identified as polynomials in $z+1$ with nonnegative integer coefficients. A recurrence relation and a signed-partition interpretation are provided for these coefficients.
  • Difference Analysis: The same characterization (polynomials in $z+1$ with nonnegative integer coefficients, recurrence, and signed-partition interpretation) is applied to the differences between corresponding unsigned first-kind and second-kind Jacobi-Stirling coefficients.
  • Real-Rootedness Proof: The study then proves that every nonzero nonnegative linear combination of the descent polynomials over Jacobi-Stirling permutations has only simple negative zeros under specific conditions.
  • Conjecture Verification: This proof specifically verifies five infinite families within a conjecture attributed to Gessel, Lin, and Zeng.
  • Polynomial Structure Analysis: Finally, using insertion operators, the research investigates the structural properties of descent polynomials over Jacobi-Stirling permutations with a fixed number of deleted barred letters.

Findings

The research yielded several specific findings:

  • Fixed diagonals of the Jacobi-Stirling numbers of the second kind can be expanded in a binomial basis. The coefficients of this expansion are polynomials in $z+1$ and possess nonnegative integer values.
  • A recurrence relation and a signed-partition interpretation were established for these specific expansion coefficients.
  • Similar properties (polynomials in $z+1$ with nonnegative integer coefficients, recurrence, and signed-partition interpretation) were found to hold for the differences between corresponding unsigned first-kind and second-kind Jacobi-Stirling coefficients.
  • Every nonzero nonnegative linear combination of the descent polynomials over Jacobi-Stirling permutations, when considering a fixed number of deleted barred letters, has only simple negative zeros under specific conditions.
  • This real-rootedness property was demonstrated when the fixed number of deleted barred letters is one, two, or three.
  • The property also holds when exactly one or two barred letters are retained.
  • These findings collectively verify five infinite families in a conjecture attributed to Gessel, Lin, and Zeng.
  • Through the application of insertion operators, it was determined that every descent polynomial over Jacobi-Stirling permutations with a fixed number of deleted barred letters is top heavy.
  • Additionally, these polynomials were found to possess an increasing left half.

Why This Matters

The verification of specific infinite families within the Gessel, Lin, and Zeng conjecture contributes to the understanding of the algebraic properties of combinatorial polynomials. The characterization of binomial expansion coefficients and the structural properties of descent polynomials (top heavy, increasing left half) provide deeper insights into the nature of Jacobi-Stirling numbers and associated permutation statistics.

Research Information

Institution
arXiv
Original Study
View Publication
Source
arXiv Math

About ICANEWS

ICANEWS is a global research journal for emerging researchers, publishing student and emerging researcher work across all fields.