Search arXiv⌕ Search

arXiv · 2610.03111

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shi-Mei Ma, Ming-Xin Wang. 2026-10-02. Binomial expansions of Jacobi-Stirling numbers and real-rootedness of Jacobi-Stirling descent polynomials. https://arxiv.org/abs/2610.03111

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening

We present new methods and results for constructing optimal Kobon triangle arrangements. First, we introduce a compact table notation for describing arrangements of pseudolines, enabling the representation and analysis of complex cases, including symmetrical arrangements, arrangements with parallel lines, and arrangements with multiple-line intersection points. Building on this, we provide a simple heuristic method and tools for recovering straight-line arrangements from a given table, with the ability to enforce additional properties such as symmetries. The tool successfully recovers arrangements for many previously known optimal solutions. Additionally, we develop a tool that transforms the search for optimal Kobon arrangement tables into a SAT problem, allowing us to leverage modern SAT solvers (specifically Kissat) to efficiently find new solutions or to show that no other solutions exist (for example, confirming that no simple perfect arrangement with 33 triangles exists in the 11-line case). Using these techniques, we find new optimal Kobon arrangements for 23 and 27 lines, along with several other new results.

math.CO↗

Marked multi-colorings and marked chromatic polynomials of hypergraphs and subspace arrangements

We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a hypergraph coincide with its marked chromatic polynomials in q, thereby generalizing a corresponding result for graphs established in Chaithra et al. 2025 (arXiv:2503.11230). These notions are then naturally extended to subspace arrangements. In particular, we prove that the number of marked multi q-colorings of a subspace arrangement is a polynomial in q. We also define the (marked) independence series for subspace arrangements and prove that the (-q)-th power of the independence series of a hyperplane arrangement has non-negative coefficients. We further investigate the coefficientwise non-negativity of the (-q)-th power of the independence series of a hypergraph. We show that all edges must have even cardinality for this non-negativity to hold, and provide a counterexample demonstrating that this condition is not sufficient.

math.CO↗

Robust ladders in the HLM tower construction for arithmetic regularity over ${\bf F}_2^{\,n}$

Green's arithmetic regularity lemma over ${\bf F}_2^n$ has tower-type lower bounds. We show that the large order properties in the Hosseini--Lovett--Moshkovitz--Shapira (HLM) construction survive sparse edits. If $d$ is the top block dimension, then changing at most $|G|/16$ points of the top HLM set $A_s$ still leaves a half-graph of height $d/8$. For a suitable choice of the HLM maps, changing at most $ε|G|$ points of a super-level set of the averaged witness still leaves a half-graph of height $d/(8\sqrt{s})\ge {\rm twr}(s-2)$. The proofs use the binary code formed by the top-level row traces and Sauer's lemma.

math.CO↗