Set families and Foulkes modules
Representation Theory
2014-10-09 v2 Combinatorics
Abstract
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label irreducible characters appearing as summands of the characters of Foulkes modules. The homomorphisms are defined using certain families of subsets of the natural numbers. These families are of independent interest; we prove a number of combinatorial results concerning them.
Keywords
Cite
@article{arxiv.1007.2946,
title = {Set families and Foulkes modules},
author = {Rowena Paget and Mark Wildon},
journal= {arXiv preprint arXiv:1007.2946},
year = {2014}
}
Comments
22 pages, 3 figures, final published version