Lower Bound for The Number of Zeros in The Character Table of The Symmetric Group

Abstract

For any two partitions $λ$ and $μ$ of a positive integer $N$, let $χ_λ(μ)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $λ$, evaluated at the conjugacy class of elements whose cycle type is determined by $μ$. Let $Z(N)$ be the number of zeros in the character table of $S_N$, and $Z_{t}(N)$ be defined as $$ Z_{t}(N):= \#\{(λ,μ): χ_λ(μ) = 0 \; \text{with $λ$ a $t$-core}\}. $$ We prove $$ Z(N) \ge \frac{2\, p(N)^{2}}{\log N} \left(1+O\left(\frac{1}{\sqrt{\log N}}\right)\right), $$ where $p(N)$ denotes the number of partitions of $N$. We also give explicit lower bounds for $Z_t(N)$ in various ranges of $t$.

Theorems & Definitions (22)

• Conjecture 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 3.1: The Murnaghan-Nakayama rule
• Lemma 3.2: peluse2020even
• Lemma 3.3
• proof
• Lemma 3.4
• proof
• Lemma 3.5: tyler2026asymptotics