LABELLING THE CHARACTER TABLES OF SYMMETRIC AND ALTERNATING GROUPS

From MaRDI portal
Publication:5458243




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 lambda and u, Xlambdau is equal to chilambda(u), the value of the irreducible character of Sn labelled by lambda on elements of cycle type u. Analogous results are proved for alternating groups, and for the Brauer character tables of symmetric and alternating groups.









This page was built for publication: LABELLING THE CHARACTER TABLES OF SYMMETRIC AND ALTERNATING GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458243)