Multiplicity-free induced characters of symmetric groups

Abstract

Let n be a non-negative integer. Combining algebraic and combinatorial techniques, we investigate for which pairs (G,) of a subgroup G of the symmetric group Sn and an irreducible character of G the induced character \!Sn is multiplicity-free. As a result, for n≥ 66, we classify all subgroups G≤ Sn which give rise to such a pair. Moreover, for the majority of these groups G we identify all the possible choices of the irreducible character , assuming n≥ 73.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…