Labelling the character tables of symmetric and alternating groups
Representation Theory
2007-05-23 v1
Abstract
Let be a character table of the symmetric group . It is shown that unless or , there is a unique way to assign partitions of to the rows and columns of so that for all and , is equal to , the value of the irreducible character of labelled by on elements of cycle type . 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