Geodesic
On Han's hook length formulas for trees
The electronic journal of combinatorics, Tome 18 (2011) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv
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 associated with staircase labelings.
DOI : 10.37236/642
Classification : 05A19, 05C05
Mots-clés : hook length formula, k-ary tree, combinatorial proof, staircase labeling 
William Y.C. Chen; Oliver X.Q. Gao; Peter L. Guo. On Han's hook length formulas for trees. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/642
@article{10_37236_642,
     author = {William Y.C. Chen and Oliver X.Q. Gao and Peter L. Guo},
     title = {On {Han's} hook length formulas for trees},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/642},
     zbl = {1250.05022},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/642/}
}
TY  - JOUR
AU  - William Y.C. Chen
AU  - Oliver X.Q. Gao
AU  - Peter L. Guo
TI  - On Han's hook length formulas for trees
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/642/
DO  - 10.37236/642
ID  - 10_37236_642
ER  - 
%0 Journal Article
%A William Y.C. Chen
%A Oliver X.Q. Gao
%A Peter L. Guo
%T On Han's hook length formulas for trees
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/642/
%R 10.37236/642
%F 10_37236_642

Cité par Sources :