The well-known fact that there is always one more addable than removable box for a Young diagram is generalized to arbitrary hooks. As an application, this immediately implies a simple proof of a conjecture of Regev and Vershik  for which inductive proofs have recently been given by Regev and Zeilberger  and Janson .
AMS Subject Classification05A17 05Exx
KeywordsYoung diagrams hooks hook numbers partitions Regev-Vershik-Conjecture
Unable to display preview. Download preview PDF.
- 1.S. Janson, Hook lengths in a skew Young diagram. Electronic J. Combin.4 (1997) #R24, 5pp.Google Scholar
- 2.J. B. Olsson, Combinatorics and representations of finite groups, Vorlesungen aus dem Fachbereich Mathematik der Universität GH Essen, Heft 20, 1993Google Scholar
- 3.A. Regev and A. Vershik, Asymptotics of Young diagrams and hook numbers, Electronic J. Combin.4 (1997) #R22, 12pp.Google Scholar
- 4.A. Regev and D. Zeilberger, Proof of a conjecture on multisets of hook numbers, Ann. Combin.1 (4) (1997) 391–394.Google Scholar