🔢 mathematics

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

This paper establishes a new lower bound for the total number of zeros in the character table of the symmetric group $S_N$ , showing that $Z(N)$ is at least proportional to $p(N)^2 / \log N$ , while also providing explicit lower bounds for the count of zeros involving $t$ -core partitions.

Original authors: Jayanta Barman, Kamalakshya Mahatab

Published 2026-04-01

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Jayanta Barman, Kamalakshya Mahatab

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are walking into a massive, ancient library. This isn't a library of books, but a library of mathematical patterns called "partitions." A partition is simply a way of breaking a number down into smaller pieces (like breaking the number 4 into 3+1 or 2+2+1).

In this library, there is a giant, mysterious grid called the Character Table of the Symmetric Group. Think of this table as a massive scoreboard where every row and every column represents a different way of arranging things.

The Mystery of the Zeros

The authors of this paper, Jayanta Barman and Kamalakshya Mahatab, are obsessed with finding the zeros in this scoreboard.

The Analogy: Imagine a giant spreadsheet where every cell contains a number. Most numbers are positive or negative, but some cells are blank (zero).
The Question: How many blank cells are there?
The Intuition: For a long time, mathematicians knew that if you picked a random cell, it was very likely to be a zero. But they didn't know exactly how many zeros existed in the whole table, especially as the numbers get huge.

The Main Discovery: Counting the Blanks

The paper proves a specific lower bound (a guaranteed minimum) for the number of zeros.

The Big Reveal:
The authors show that the number of zeros is roughly:
$\frac{2 \times (\text{Total Size of Table})}{\log(\text{Size of Table})}$

In Everyday Language:
Imagine the table has a billion entries. The paper proves that a significant chunk of them—specifically, about $2$ out of every $\log(\text{billion})$ entries—must be zero. It's like saying, "If you have a stadium full of people, we can guarantee that at least this many people are wearing red hats," even if you can't count every single person.

They didn't just guess this; they used a clever mathematical tool called the Murnaghan-Nakayama Rule.

The Metaphor: Think of this rule as a "magic eraser." It tells you that if you have a specific type of pattern (called a "t-core") and you try to match it with a specific type of number breakdown, the result must be zero. It's like a lock and key: if the key shape doesn't fit the lock, the door stays shut (the value is zero).

The Two-Part Strategy

To count these zeros, the authors split the problem into two zones, like searching a beach for shells:

The "Deep Water" Zone (Large Numbers): Here, they used a very recent, complex formula (from a mathematician named Tyler) to estimate how many "special patterns" exist. They found that in this deep zone, the number of zeros is huge.
The "Shallow Water" Zone (Medium Numbers): Here, they used an older, classic formula (from Erdős and Lehner) to count how many ways you can break numbers into smaller pieces.

By adding the zeros found in both zones, they proved that the total number of zeros is at least what their formula predicts.

The "Strip" of the Table (Theorem 1.3)

The paper also looks at a specific slice of the table. Imagine the table is a cake. Instead of counting all the zeros in the whole cake, they looked at a specific horizontal strip where the rows have a special property (called being a " $t$ -core").

They proved that even within this specific strip, there are plenty of zeros, and they gave a formula to estimate exactly how many, depending on how "wide" the strip is.

Why Does This Matter?

You might ask, "Who cares about zeros in a math table?"

It's about Structure: In mathematics, zeros often reveal hidden symmetries or rules that govern how things fit together. Finding where the zeros are helps us understand the "skeleton" of the Symmetric Group.
It's a Milestone: For decades, mathematicians had a guess (a conjecture) about how many zeros there were. This paper proves that the guess was right (at least for the minimum number). It's like finally measuring the height of a mountain that people had only been guessing about for 100 years.
Future Doors: The authors suggest this method could be used to solve similar puzzles in other areas of math, like the symmetries of crystals or complex geometric shapes.

Summary

In short, Barman and Mahatab took a giant, chaotic grid of numbers, used a "magic eraser" rule to find where the blanks must be, and proved that the number of blanks is massive and follows a predictable pattern. They turned a vague guess into a solid mathematical fact, showing us that even in the world of abstract numbers, there is a beautiful, countable order.

1. Problem Statement

The paper addresses the problem of estimating the number of zeros, denoted as $Z(N)$ , in the character table of the symmetric group $S_N$ .

Context: The character table of $S_N$ has dimensions $p(N) \times p(N)$ , where $p(N)$ is the number of partitions of $N$ . The entry $\chi_\lambda(\mu)$ represents the value of the irreducible character associated with partition $\lambda$ evaluated at the conjugacy class determined by partition $\mu$ .
Background: While linear characters never vanish, Burnside's theorem states that every non-linear irreducible character vanishes on some group element. Miller (2010s) conjectured that the proportion of zeros approaches 1 as $N \to \infty$ . Specifically, Conjecture 1.1 posits:
$\frac{Z(N)}{p(N)^2} \sim \frac{2}{\log N} \quad \text{as } N \to \infty.$
Objective: The authors aim to prove a rigorous lower bound for $Z(N)$ that matches the leading term of this conjecture, specifically showing $Z(N) \gtrsim \frac{2p(N)^2}{\log N}$ . They also investigate $Z_t(N)$ , the number of zeros restricted to rows where the partition $\lambda$ is a $t$ -core (a partition with no hook lengths divisible by $t$ ).

2. Methodology

The proof relies on a combination of combinatorial group theory, analytic number theory, and asymptotic analysis.

A. Combinatorial Lower Bound via Murnaghan-Nakayama Rule

The authors utilize the Murnaghan-Nakayama rule to establish a sufficient condition for a character value to be zero:

Lemma 3.2: If $\mu$ has a part of size $t$ and $\lambda$ is a $t$ -core, then $\chi_\lambda(\mu) = 0$ .
Summation Strategy: Since the sets of partitions $\mu$ $μ$ with largest part $t$ $t$ are disjoint for different $t$ $t$ , the total number of zeros is bounded below by summing over all possible $t$ $t$ :
$Z(N) \ge \sum_{t=1}^N c_t(N) p_t(N-t)$
where:
- $c_t(N)$ is the number of $t$ -core partitions of $N$ .
- $p_t(N-t)$ is the number of partitions of $N-t$ into parts of size at most $t$ .

B. Asymptotic Estimates

To evaluate the sum, the authors derive precise asymptotic formulas for the components $c_t(N)$ and $p_t(N-t)$ across different ranges of $t$ relative to $N$ :

For $c_t(N)$ (Number of $t$ -cores):
- They utilize recent results by Tyler [14], which express $c_t(N)$ using the Dedekind eta function $\eta(z)$ and specific modular forms.
- The authors simplify Tyler's complex formulas into explicit bounds for three distinct regimes of $t$ $t$ :
  - Small $t$ ( $t \ll \sqrt{N}$ ).
  - Intermediate $t$ ( $t \approx \sqrt{N}$ ).
  - Large $t$ ( $t \to N$ ).
- Key tools include the modular transformation of $\eta(z)$ and bounds on the error terms involving $e^{-2\pi y}$ .
For $p_t(N-t)$ (Partitions with restricted part size):
- They adapt the classical result of Erdős and Lehner [3] regarding the distribution of the largest part in a random partition.
- They provide an explicit error term for the asymptotic formula:
  $p_t(N) \approx p(N) \exp\left(-\frac{2}{C} e^{-Cx/2}\right)$
  where $C = 2\pi/\sqrt{6}$ and $t$ is parameterized by $x$ .

C. Splitting the Sum

The main summation $\sum c_t(N) p_t(N-t)$ is split into two ranges ( $A_1$ and $A_2$ ) based on carefully chosen thresholds $T_1$ and $T_2$ (proportional to $\sqrt{N} \log N$ ):

Range $A_2$ (Large $t$ ): Dominated by the behavior where $t$ is large enough that $p_t(N-t)$ drops significantly, but $c_t(N)$ remains substantial.
Range $A_1$ (Intermediate $t$ ): The "sweet spot" where the product of the counts is maximized.
The authors use Abel summation and the Laplace method for integrals to evaluate the sums asymptotically, showing that the contribution from the intermediate range yields the dominant term.

3. Key Contributions and Results

Main Theorem (Theorem 1.2)

The authors prove the following lower bound for the total number of zeros $Z(N)$ :
$Z(N) \ge \frac{2p(N)^2}{\log N} \left( 1 + O\left(\frac{1}{\sqrt{\log N}}\right) \right)$

Significance: This confirms the leading term of Conjecture 1.1. If the conjecture is true, this lower bound is optimal. It resolves a problem posed by Miller and Scheinerman regarding the density of zeros.

Refined Bounds for $t$ -cores (Theorem 1.3)

The paper provides explicit lower bounds for $Z_t(N)$ (zeros where $\lambda$ is a $t$ -core) in three regimes:

Small $t$ : $Z_t(N) \ge R_t(N) p(N)$ , where $R_t(N)$ is an explicit function involving powers of $N$ and $t$ .
Intermediate $t$ : $Z_t(N) \ge Q_t(N) p(N)$ , with specific exponential decay factors.
Large $t$ : A bound involving double exponential terms, showing that even for large $t$ , a significant number of zeros exist.

These results generalize previous work by McSpirit and Ono (which was limited to fixed primes $t \ge 5$ ) to the case where both $N$ and $t$ tend to infinity.

4. Significance and Implications

Resolution of a Conjecture: The paper provides the first rigorous proof matching the conjectured asymptotic density of zeros in the symmetric group character table.
Methodological Advancement: It successfully bridges the gap between the combinatorial structure of $t$ -cores (via Tyler's recent work) and the probabilistic distribution of partition parts (via Erdős-Lehner).
Explicit Error Terms: Unlike previous heuristic or simulation-based results (like Miller's Monte Carlo simulations), this paper provides rigorous asymptotic expansions with explicit error terms ( $O(\cdot)$ ).
Future Directions: The authors suggest that their techniques could be extended to Weyl groups and wreath products of symmetric groups, potentially solving similar zero-distribution problems in broader representation theory contexts.

Conclusion

Barman and Mahatab successfully demonstrate that the number of zeros in the character table of $S_N$ grows at least as fast as $\frac{2p(N)^2}{\log N}$ . By decomposing the problem into $t$ -core partitions and utilizing advanced asymptotic analysis of partition functions, they provide a definitive lower bound that aligns with the statistical predictions of random character values, significantly advancing the understanding of the zero-structure in symmetric group representations.