Increasing Binary Trees and the $(\alpha,\beta)$-Eulerian Polynomials
Combinatorics
2025-03-31 v2
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.
Cite
@article{arxiv.2404.10331,
title = {Increasing Binary Trees and the $(\alpha,\beta)$-Eulerian Polynomials},
author = {William Y. C. Chen and Amy M. Fu},
journal= {arXiv preprint arXiv:2404.10331},
year = {2025}
}
Comments
17 pages, 7 figures, to appear in Ann. Combin