English

Multiplicity-free induced characters of symmetric groups

Representation Theory 2025-08-14 v3 Combinatorics

Abstract

Let nn be a non-negative integer. Combining algebraic and combinatorial techniques, we investigate for which pairs (G,ρ)(G,\rho) of a subgroup GG of the symmetric group SnS_n and an irreducible character ρ\rho of GG the induced character ρ ⁣Sn\rho\!\uparrow^{S_n} is multiplicity-free. As a result, for n66n\geq 66, we classify all subgroups GSnG\leq S_n which give rise to such a pair. Moreover, for the majority of these groups GG we identify all the possible choices of the irreducible character ρ\rho, assuming n73n\geq 73.

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