Skip to content

Labelling the character tables of symmetric and alternating groups

Mark Wildon

math.RTarXiv:math/0612292

Abstract

Let X be a character table of the symmetric group Sn. It is shown that unless n = 4 or n=6, there is a unique way to assign partitions of n to the rows and columns of X so that for all λ and ν, Xλν is equal to χλ(ν), the value of the irreducible character of Sn 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.

Create a lesson