Abstract
We prove combinatorial rules that give the minimal and maximal partitions labelling the irreducible constituents of a family of characters for the symmetric group that generalize Foulkes permutation characters. Restated in the language of symmetric functions, our results determine all minimal and maximal partitions that label Schur functions appearing in the plethysms $s_\nu \circ s_{(m)}$. As a corollary we prove two conjectures of Agaoka on the lexicographically least constituents of the plethysms $s_\nu \circ s_{(m)}$ and $s_\nu \circ s_{(1^m)}$.
Original language | English |
---|---|
Pages (from-to) | 301-318 |
Number of pages | 18 |
Journal | Journal of the London Mathematical Society |
Volume | 93 |
Issue number | 2 |
Early online date | 22 Jan 2016 |
DOIs | |
Publication status | Published - Apr 2016 |