Search arXivSearch

arXiv · 2507.18959

Higher-order Stirling cycle and subset triangles: Total positivity, continued fractions and real-rootedness

Abstract

Given a lower-triangular matrix of real numbers, one can ask the following four total-positivity questions: total positivity of the triangle itself; total positivity of its row-reversal; Toeplitz-total positivity of its row sequences (equivalent to negative-real-rootedness of the row-generating polynomials); and coefficientwise Hankel-total positivity of the sequence of row-generating polynomials. In this paper, we introduce two infinite families of lower-triangular matrices generalising the Stirling cycle and subset triangles, parametrised by an integer $r \ge 1$; we call these the $r$th-order Stirling cycle and subset numbers. We then ask the foregoing four questions for each of these triangles, leading us to several conjectures. We then prove some of these conjectures for the case $r=2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bishal Deb, Alan D. Sokal. 2025-07-25. Higher-order Stirling cycle and subset triangles: Total positivity, continued fractions and real-rootedness. https://arxiv.org/abs/2507.18959

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO