On hooks of Young diagrams
暂无分享,去创建一个
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].
[1] Svante Janson. Hook Lengths in a Skew Young Diagram , 1997, Electron. J. Comb..
[2] Amitai Regev,et al. Asymptotics of Young Diagrams and Hook Numbers , 1997, Electron. J. Comb..
[3] Jørn B. Olsson,et al. Combinatorics and representations of finite groups , 1993 .