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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…