Irreducible characters of the symmetric group and exponential growth
Abstract
We consider sequences of degrees of ordinary irreducible Sn-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of n with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.