Hook lengths in a skew Young diagram
The electronic journal of combinatorics, Tome 4 (1997) no. 1
Regev and Vershik (Electronic J. Combinatorics 4 (1997), #R22) have obtained some properties of the set of hook lengths for certain skew Young diagrams, using asymptotic calculations of character degrees. They also conjectured a stronger form of one of their results. We give a simple inductive proof of this conjecture. Very recently, Regev and Zeilberger (Annals of Combinatorics, to appear) have independently proved this conjecture.
@article{10_37236_1309,
author = {Svante Janson},
title = {Hook lengths in a skew {Young} diagram},
journal = {The electronic journal of combinatorics},
year = {1997},
volume = {4},
number = {1},
doi = {10.37236/1309},
zbl = {0885.05110},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1309/}
}
Svante Janson. Hook lengths in a skew Young diagram. The electronic journal of combinatorics, Tome 4 (1997) no. 1. doi: 10.37236/1309
Cité par Sources :