Irreducible characters of the symmetric group and exponential growth
classification
🧮 math.CO
math.RT
keywords
charactersexponentialgrowthirreducibleassumeboundboundedcoefficient
read the original abstract
We consider sequences of degrees of ordinary irreducible $S_n$-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.