A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees
نویسنده
چکیده
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.
منابع مشابه
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov’s hook length formula for binary trees. AMS Classification: 05A15, 05A19
متن کاملLabeled Trees, Functions, and an Algebraic Identity
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher label. This solves a problem posed by Shin and Zeng in a recent article. We also provide a generalization of this identity that translates to a formula for t...
متن کاملGeneralized Parking Functions, Descent Numbers, and Chain Polytopes of Ribbon Posets
We consider the inversion enumerator In(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = −1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula In(−1) = En, the number of alternating perm...
متن کاملAn Enumeration of Flags in Finite Vector Spaces
By counting flags in finite vector spaces, we obtain a q-multinomial analog of a recursion for q-binomial coefficients proved by Nijenhuis, Solow, and Wilf. We use the identity to give a combinatorial proof of a known recurrence for the generalized Galois numbers.
متن کاملA Reduction Theorem for Perfect Matchings of Graphs Having a Cellular Completion
A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is containedin at most two cells. We present a \ReductionTheorem" for the number of matchingsof certain subgraphs of cellular graphs. This generalizesthe main result of Ci1]. As applications of the Reduction Theorem we obtain a new proof of Stanley's multivariate version of the Aztec diam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 2005