A combinatorial proof of the supper symmetric property of hook length
classification
🧮 math.CO
keywords
lengthpropertysymmetricappearcombinatorialhookkindsproof
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.