Search arXivSearch

arXiv · 2609.15651

Multivariate stability of powered triangular recurrences and parametrised Eulerian polynomials

Abstract

We prove multivariate stability for a class of affine triangular recurrences whose two coefficients are raised to an arbitrary positive integer power. The variables keep track of cross-step heights in a weighted lattice-path model. The applications include stability and real rootedness of parametrised Eulerian, Stirling, and Lah families. For the parametrised Eulerian polynomials, we obtain multivariate refinements of known real-rootedness results and prove simplicity and strict interlacing of consecutive rows. A kernel-preserving bijection with increasing binary trees yields a synchronised Foata--Strehl action on pairs and a combinatorial interpretation of their gamma coefficients along with a recurrence. The same bijection identifies refinement posets that admit symmetric Boolean and chain decompositions for parameter one and cover-supported $\mathfrak{sl}_2$ operators prove their PECKness. We extend the stability and strict interlacing results to synchronised Stirling permutations and prove PECKness for ordinary Stirling permutations with a fixed number of plateaux.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Umesh Shankar. 2026-09-14. Multivariate stability of powered triangular recurrences and parametrised Eulerian polynomials. https://arxiv.org/abs/2609.15651

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