Discovering hook length formulas by an expansion technique
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We introduce a hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook length expansion. The paper can be seen as a collection of hook length formulas for partitons and plane trees. All examples are illustrated by HookExp and, for many easy cases, expained by well-known combinatorial arguments.
DOI : 10.37236/857
Classification : 05A15, 05A30, 05C05
Mots-clés : hook length expansion, hook length formulas, partitions, plane trees, Maple package HookExp
@article{10_37236_857,
     author = {Guo-Niu Han},
     title = {Discovering hook length formulas by an expansion technique},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/857},
     zbl = {1165.05305},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/857/}
}
TY  - JOUR
AU  - Guo-Niu Han
TI  - Discovering hook length formulas by an expansion technique
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/857/
DO  - 10.37236/857
ID  - 10_37236_857
ER  - 
%0 Journal Article
%A Guo-Niu Han
%T Discovering hook length formulas by an expansion technique
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/857/
%R 10.37236/857
%F 10_37236_857
Guo-Niu Han. Discovering hook length formulas by an expansion technique. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/857

Cité par Sources :