On the Irreducible Character Degrees of Symmetric Groups and their Multiplicities

We consider problems concerning the largest degrees of irreducible characters of symmetric groups, and the multiplicities of character degrees of symmetric groups. Using evidence from computer experiments, we posit several new conjectures or extensions of previous conjectures, and prove a number of results. One of these is that, if ≥21, then there are at least eight irreducible characters of , all of which have the same degree, and which have irreducible restriction to . We explore similar questions about unipotent degrees of GL⁢(). We also make some remarks about how the experiments here shed light on posited algorithms for finding the largest irreducible character degree of .