Maximal degrees for Young diagrams in the \((k,l)\) hook

DOI10.1006/eujc.1997.0200zbMath0918.05101OpenAlexW2001192191MaRDI QIDQ1272776

Amitai Regev

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

zbMATH Keywords

Young tableaumaximal degreehook partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)

Related Items (4)

The computational complexity of rules for the character table of \(S_n\). ⋮ The mathematics of Amitai Regev ⋮ Expected lengths and distribution functions for Young diagrams in the hook ⋮ Degrees of irreducible characters of the symmetric group and exponential growth

This page was built for publication: Maximal degrees for Young diagrams in the \((k,l)\) hook