Labelling the character tables of symmetric and alternating groups

Mark Wildon

Let $X$ be a character table of the symmetric group $S_n$. 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…