Year: 2011
Type: preprint
Abstract: 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 with staircase labelings.
Source: arXiv (Cornell University)
Institution: Nankai University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G2717198908
OpenAlex ID: W2953229938