Search arXivSearch

arXiv · 2404.10331

Increasing Binary Trees and the $(α,β)$-Eulerian Polynomials

Abstract

In light of the grammar given by Ji for the $(α,β)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the $γ$-coefficients of the $α$-Eulerian polynomials in terms of forests of planted 0-1-2-plane trees, which specializes to a combinatorial interpretation of the $γ$-coefficients of the derangement polynomials in the same vein. By means of a decomposition of an increasing binary tree into a forest, we find combinatorial interpretations of the sums involving two identities of Ji, one of which can be viewed as $(α,β)$-extensions of the formulas of Petersen and Stembridge.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Y. C. Chen, Amy M. Fu. 2025-03-28. Increasing Binary Trees and the $(α,β)$-Eulerian Polynomials. https://arxiv.org/abs/2404.10331

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