A combinatorial proof of the supper symmetric property of hook length
Masanori Ando

TL;DR
This paper provides a combinatorial proof demonstrating the super symmetric property of hook lengths in Young diagrams, showing uniform distribution of different hook types.
Contribution
It introduces a combinatorial proof for the super symmetric property of hook lengths, a novel approach in understanding Young diagram structures.
Findings
Hook lengths of different types appear uniformly in Young diagrams.
A combinatorial proof confirms the super symmetric property.
Uniform distribution of hook types is established.
Abstract
There are kinds of length hooks with different arm length. Actually, this kinds appear uniformly in Young diagrams of size . The property ``appear uniformly'' is called super symmetric. We give a combinatorial proof of the supper symmetric property of hook length.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematics and Applications · graph theory and CDMA systems
