Bijective proofs of the hook formula for rooted trees
نویسنده
چکیده
We present a bijective proof of the hook length formula for rooted trees based on the ideas of the bijective proof of the hook length formula for standard tableaux by Novelli, Pak and Stoyanovskii [10]. In section 4 we present another bijection for the formula. MR Subject Classification: 05A05,05A15
منابع مشابه
Probabilistic proofs of hook length formulas involving trees
Let T be a rooted tree with n distinguishable vertices. We use T to stand for the vertex set of T . An increasing labeling of T is a bijection ` : T → {1, 2, . . . , n} such that `(v) ≤ `(w) for all descendents w of v. Let f be the number of increasing labelings. The hooklength, hv, of a vertex v is the number of descendents of v (including v itself). The hook length formula for trees states th...
متن کاملNew hook length formulas for binary trees
— We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length h v appears as an exponent. Consider the set B (n) of all binary trees with n vertices. It is well-known that the cardinality of B (n) is equal to the Catalan number (see, e.g., [9, p.220]): (1) T ∈B(n) 1 = 1 n + 1 2n n. For each vertex v of a binary tree T ∈ B (n) the hook length ...
متن کاملBijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
Bijective proofs of the hook formulas for the number of ordinary standard Young tableaux and for the number of shifted standard Young tableaux are given. They are formulated in a uniform manner, and in fact prove q-analogues of the ordinary and shifted hook formulas. The proofs proceed by combining the ordinary, respectively shifted, Hillman–Grassl algorithm and Stanley's (P, ω)-partition theor...
متن کاملA multivariate hook formula for labelled trees
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The righthand side can be written nicely as a product of linear factors. We study two specializations of this new formula, including Cayley’s enumeration of trees with respect to vertex deg...
متن کاملOn Han's Hook Length Formulas for Trees
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 106 شماره
صفحات -
تاریخ انتشار 2012