English

Irreducible characters of the symmetric group and exponential growth

Combinatorics 2014-06-09 v1 Representation Theory

Abstract

We consider sequences of degrees of ordinary irreducible SnS_n-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of nn with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound.

Keywords

Cite

@article{arxiv.1406.1653,
  title  = {Irreducible characters of the symmetric group and exponential growth},
  author = {Antonio Giambruno and Sergey Mishchenko},
  journal= {arXiv preprint arXiv:1406.1653},
  year   = {2014}
}

Comments

9 pages, 1 figure