arXiv · 0709.0897
Symmetric Group Character Degrees and Hook Numbers
Abstract
In this article we prove the following result: that for any two natural numbers k and j, and for all sufficiently large symmetric groups Sym(n), there are k disjoint sets of j irreducible characters of Sym(n), such that each set consists of characters with the same degree, and distinct sets have different degrees. In particular, this resolves a conjecture most recently made by Moretó. The methods employed here are based upon the duality between irreducible characters of the symmetric groups and the partitions to which they correspond. Consequently, the paper is combinatorial in nature.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
David A. Craven. 2007-09-06. Symmetric Group Character Degrees and Hook Numbers. https://doi.org/10.1112/plms%2Fpdm028
Cite the original work for its findings. Save a collection to share your selection of sources.