Vanishing pairs of conjugacy classes for the symmetric group
Velmurugan S
TL;DR
This paper classifies pairs of conjugacy classes in the symmetric group $S_n$ for which every non-linear irreducible character vanishes on at least one member of the pair, establishing that for $n>6$ the only such pair is $\\{(n),(n-1,1)\\}$. The authors deploy the Murnaghan-Nakayama rule, Schur's second orthogonality relations, and Navarro's product-of-conjugacy-classes lemma to derive necessary constraints, followed by a comprehensive case analysis on cycle-type partitions to rule out all alternatives. The result complements existing bounds on the number of vanishing classes (k(S_n)=2) and parallels related theorems about common zeros of irreducible characters. The findings hold for large $n$ with small cases amenable to direct check, highlighting precise vanishing behavior in $S_n$ tied to specific cycle structures.
Abstract
In this short note, we classify pairs of conjugacy classes of the symmetric group such that any non-linear irreducible character of the symmetric group vanishes on at least one of them.
