English

Labelling the character tables of symmetric and alternating groups

Representation Theory 2007-05-23 v1

Abstract

Let XX be a character table of the symmetric group SnS_n. It is shown that unless n=4n = 4 or n=6n=6, there is a unique way to assign partitions of nn to the rows and columns of XX so that for all λ\lambda and ν\nu, XλνX_{\lambda\nu} is equal to χλ(ν)\chi^\lambda(\nu), the value of the irreducible character of SnS_n labelled by λ\lambda on elements of cycle type ν\nu. Analogous results are proved for alternating groups, and for the Brauer character tables of symmetric and alternating groups.

Keywords

Cite

@article{arxiv.math/0612292,
  title  = {Labelling the character tables of symmetric and alternating groups},
  author = {Mark Wildon},
  journal= {arXiv preprint arXiv:math/0612292},
  year   = {2007}
}

Comments

12 pages