Labelling the character tables of symmetric and alternating groups
Mark Wildon
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
Related papers
Noncommutative Cluster Varieties and Moduli Spaces of Local Systems
Zachary Greenberg, Dani Kaufman, Merik Niemeyer et al.
The Saito determinant for extended affine Weyl discriminant strata
Andrea Brini, Karoline van Gemst
Unitary Shimura Correspondence for Complex Classical Groups
Wan-Yu Tsai, Kayue Daniel Wong, Hongfeng Zhang
An enhanced Helgason-Johnson bound for Sp(p, q)
Zhan Ying, Chao-Ping Dong
Auslander-Reiten (n+2)-angles and local finiteness
Jian He, Yu-Zhe Liu, Panyue Zhou
A σ-McKay theorem for π-separable groups
David Cabrera-Berenguer