Multiplicity-free induced characters of symmetric groups
Representation Theory
2025-08-14 v3 Combinatorics
Abstract
Let be a non-negative integer. Combining algebraic and combinatorial techniques, we investigate for which pairs of a subgroup of the symmetric group and an irreducible character of the induced character is multiplicity-free. As a result, for , we classify all subgroups which give rise to such a pair. Moreover, for the majority of these groups we identify all the possible choices of the irreducible character , assuming .
Keywords
Cite
@article{arxiv.2309.07761,
title = {Multiplicity-free induced characters of symmetric groups},
author = {Pavel Turek},
journal= {arXiv preprint arXiv:2309.07761},
year = {2025}
}
Comments
70 pages, 16 figures. v2: Minor referee corrections. v3: Minor typos corrected