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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.