Minimal numbers of linear constituents in Sylow restrictions for symmetric groups
Bim Gustavsson, Stacey Law
TL;DR
This work determines which irreducible characters of the symmetric group $S_n$ restrict to a Sylow $p$-subgroup $P$ with at most $p$ distinct linear constituents, resolving a question of Giannelli–Navarro. It develops a two-pronged analysis: for $p=2$ it yields a complete, explicit classification tied to almost-hook partitions and derives a precise formula for Sylow branching coefficients in that case, including a bijection between hook-like partitions and linear constituents. For odd primes $p$, the authors provide a sharp, case-based criterion depending on the $p$-adic structure of $n$ and the partition class, together with explicit computations of linear constituents via plethysm and wreath-product machinery. The results illuminate the positivity and distribution of Sylow branching coefficients, relate them to the Littlewood–Richardson and plethysm frameworks, and have implications for understanding $\Phi(S_n,p)$ and related questions for $A_n$. Overall, the paper advances the explicit understanding of how irreducible characters of $S_n$ decompose when restricted to Sylow subgroups and showcases how combinatorics of partitions governs these Sylow branching phenomena.
Abstract
Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and Navarro. Moreover, we identify all of the linear constituents of such characters, and in the case $p = 2$ explicitly calculate a new class of Sylow branching coefficients for symmetric groups indexed by so-called almost hook partitions.
