Annals of Combinatorics 2 (1998) 103-110


On Hooks of Young Diagrams

Christine Bessenrodt

Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg D-39016 Magdeburg, Germany
bessen@mathematik.uni-magdeburg.de

Received Feburary 18, 1998

AMS Subject Classification: 05A17, 05Exx

Abstract.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[3] for which inductive proofs have recently been given by Regev and Zeilberger[4] and Janson[1].

Keywords: Young diagrams, hooks, hook numbers, partitions,Regev-Vershik-Conjecture


References

1.  S. Janson, Hook lengths in a skew Young diagram. Electronic J. Combin. 4 (1997) \#R24, 5pp.

2.  J.B. Olsson, Combinatorics and representations of finite groups, Vorlesungen aus dem Fachbereich Mathematik der Universität GH Essen, Heft 20, 1993

3.  A. Regev and A. Vershik, Asymptotics of Young diagrams and hook numbers, Electronic J. Combin. 4 (1997) \#R22, 12pp.

4.  A. Regev and D. Zeilberger, Proof of a conjecture on multisets of hook numbers, Ann. Combin. 1 (4) (1997) 391–394.


Get the LaTex | DVI | PS file of this abstract.

back