arXiv Analytics

Sign in

arXiv:0903.2864 [math.RT]AbstractReferencesReviewsResources

Multiplicity-free representations of symmetric groups

Mark Wildon

Published 2009-03-16Version 1

Building on work of Saxl, we classify the multiplicity-free permutation characters of all symmetric groups of degree 66 or more. A corollary is a complete list of the irreducible characters of symmetric groups (again of degree 66 or more) which may appear in a multiplicity-free permutation representation. The multiplicity-free characters in a related family of monomial characters are also classified. We end by investigating a consequence of these results for Specht filtrations of permutation modules defined over fields of prime characteristic. Remark: parallel work of Godsil and Meagher (arXiv:math/0612567) gives an independent classification of the multiplicity-free permutation characters of symmetric groups of all degrees.

Related articles: Most relevant | Search more
arXiv:1108.1025 [math.RT] (Published 2011-08-04, updated 2012-05-08)
The complexities of some simple modules of the symmetric groups
arXiv:math/0510060 [math.RT] (Published 2005-10-04)
Elementary divisors of Cartan matrices for symmetric groups
arXiv:0801.2496 [math.RT] (Published 2008-01-16)
A new approach to the representation theory of the symmetric groups. IV. $ \Bbb Z_{2}$-graded groups and algebras