A combinatorial proof of the supper symmetric property of hook length
Abstract
There are $k$ kinds of length $k$ hooks with different arm length. Actually, this $k$ kinds appear uniformly in Young diagrams of size $n$. The property ``appear uniformly'' is called super symmetric. We give a combinatorial proof of the supper symmetric property of hook length.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2019
- DOI:
- 10.48550/arXiv.1904.00543
- arXiv:
- arXiv:1904.00543
- Bibcode:
- 2019arXiv190400543A
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- This is the content already on C. Bessenrodt, `On hooks of Young diagrams', Annals of Comb. 2 (1998) 103-110