A combinatorial proof of the supper symmetric property of hook length

Masanori Ando

A combinatorial proof of the supper symmetric property of hook length

Combinatorics 2019-04-09 v2

Authors: Masanori Ando

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.

Keywords

hook length super symmetric young diagram combinatorial proof uniform appearance

Cite

@article{arxiv.1904.00543,
  title  = {A combinatorial proof of the supper symmetric property of hook length},
  author = {Masanori Ando},
  journal= {arXiv preprint arXiv:1904.00543},
  year   = {2019}
}

Comments

This is the content already on C. Bessenrodt, `On hooks of Young diagrams', Annals of Comb. 2 (1998) 103-110

Related papers

View all related →