Maximal degrees for Young diagrams in the \((k,l)\) hook
From MaRDI portal
Publication:1272776
DOI10.1006/eujc.1997.0200zbMath0918.05101MaRDI QIDQ1272776
Publication date: 23 March 1999
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1997.0200
05A17: Combinatorial aspects of partitions of integers
05E10: Combinatorial aspects of representation theory
Related Items
The mathematics of Amitai Regev, Expected lengths and distribution functions for Young diagrams in the hook, The computational complexity of rules for the character table of \(S_n\).