🔢 mathematics

Congruences for hook lengths of partitions

This paper generalizes and derives known congruences for hook lengths in self-conjugate and all partitions using existing addition theorems, while extending these results to $z$ -asymmetric partitions through a newly proved addition-multiplication theorem.

Original authors: Frédéric Jouhet, David Wahiche

Published 2026-01-26

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Frédéric Jouhet, David Wahiche

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 have a giant, infinite warehouse filled with boxes. Inside this warehouse, you can build towers using these boxes. In the world of mathematics, these towers are called partitions. You build a tower by stacking rows of boxes, where each row is never longer than the one above it.

Now, imagine every single box in your tower has a special "hook" attached to it. This hook reaches out to the right and down, counting how many boxes it touches. The total number of boxes in this hook is its hook length.

Mathematicians love to count things. They want to know: "If I build a tower with exactly 100 boxes, how many of those hooks have a length of 5? Or 7? Or 10?"

This paper is like a master key that unlocks a hidden pattern in these counts. The authors, Frédéric Jouhet and David Wahiche, show that when you look at specific, highly organized types of towers, the counts of these hooks follow strict, predictable rules called congruences. In simple terms, this means the numbers always end up being divisible by a specific number (like always being a multiple of 3, or 5).

Here is how they did it, broken down into simple concepts:

1. The Special Towers: Self-Conjugate and "Z-Asymmetric"

Not all towers are created equal.

Self-Conjugate Towers: Imagine a tower that looks exactly the same if you hold a mirror up to its diagonal corner. If you swap the rows and columns, it's the same shape. These are called self-conjugate partitions.
Z-Asymmetric Towers: The authors also looked at a broader family of towers. Imagine taking a self-conjugate tower and sticking a rectangular block of boxes onto the side or bottom. These are called z-asymmetric partitions.

2. The Magic Trick: The Littlewood Decomposition

To solve the puzzle, the authors use a mathematical "magic trick" called the Littlewood decomposition.

Think of a complex tower as a tangled ball of yarn. The Littlewood decomposition is a tool that untangles this yarn into two distinct parts:

The Core: A small, sturdy, unchangeable base that cannot be broken down further.
The Quotient: A set of smaller, simpler towers that were wrapped around the core.

The genius of this paper is showing that for these special towers (the self-conjugate and z-asymmetric ones), the "yarn" untangles in a very specific, symmetrical way. The smaller towers in the "Quotient" part aren't random; they are copies of each other or mirror images.

3. The "Addition-Multiplication" Theorem

The authors proved a new rule (a theorem) that acts like a recipe.

The Addition Part: If you know how many hooks exist in the smaller, simpler towers (the Quotient), you can instantly calculate how many hooks exist in the big, complex tower.
The Multiplication Part: Because the smaller towers are often identical copies (due to the symmetry), the math simplifies dramatically. Instead of adding up thousands of different possibilities, you are essentially multiplying a simple pattern by itself.

4. The Big Discovery: The "Divisible" Pattern

Because of this symmetry and the recipe they found, the authors discovered a surprising truth:

When you count the hooks of a specific length in these special towers, the total number is always divisible by a certain number.

Example: If you look at self-conjugate towers and count hooks of length 4, the total count for any tower size will always be a multiple of 4.
The Twist: They found that for odd numbers (like length 3 or 5), this rule only works if you look at a specific subset of these towers (where the "Core" part is empty or meets certain conditions). If you look at all towers, the pattern breaks. But if you filter them correctly, the pattern returns.

5. Why This Matters (According to the Paper)

The paper doesn't talk about building bridges or curing diseases. Instead, it solves a pure math puzzle.

It confirms a guess (conjecture) made by other mathematicians about self-conjugate towers.
It takes a known rule for "normal" towers and extends it to these special, mirrored, and "z-asymmetric" towers.
It provides a new, unified way to look at these problems using a single "Addition-Multiplication" formula, rather than needing a different formula for every new type of tower.

In a nutshell:
The authors found a way to untangle complex box towers into simpler pieces. They realized that for certain symmetrical towers, the pieces are so perfectly matched that the total count of "hooks" always follows a strict rule: the numbers are always divisible by a specific factor. They proved this rule works for a whole new family of towers, solving a mystery that had puzzled mathematicians for a while.

Technical Summary: Congruences for Hook Lengths of Partitions

Problem Statement
The paper investigates combinatorial congruences regarding the number of hook lengths of a fixed length $t$ within specific subsets of integer partitions. While it is a known result (due to Bessenrodt, and Bacher and Manivel) that the total number of hooks of length $t$ among all partitions of an integer $n$ is congruent to $0 \pmod t$ , recent work by Amdeberhan et al. established a similar congruence for self-conjugate partitions when $t$ is even. The primary problem addressed is to derive these existing results more directly, generalize them to cases involving odd $t$ (under specific restrictions), and extend these congruences to the broader class of $z$ -asymmetric partitions defined by Ayyer and Kumari.

Methodology
The authors employ the Littlewood decomposition, a classical bijection in partition theory that maps a partition $\lambda$ to a pair (or tuple) consisting of a $t$ -core $\omega$ and a $t$ -quotient $\nu$ . The methodology relies on two main theoretical tools:

Addition Theorems: Utilizing formal power series identities derived from the Littlewood decomposition to relate the generating functions of hook lengths in a subset of partitions to the generating functions of the underlying cores and quotients.
Multiplication Theorems: Employing product formulas for generating functions to derive structural properties of the partition sets.

The paper specifically adapts these theorems to:

Self-conjugate partitions ($SC$): Where the Littlewood decomposition yields specific symmetries in the quotient.
$z$ -asymmetric partitions ( $P_z$ ): Defined by Frobenius notation $\lambda = \binom{a_1+z, \dots, a_d+z}{a_1, \dots, a_d}$ .
Restricted subsets ( $BG_{z,t}$ ): A subset of $P_z$ defined by conditions on the principal hook lengths to ensure the $t$ -quotient components behave in a way that allows for factorization.

Key Contributions and Results

Derivation and Generalization for Self-Conjugate Partitions:
The authors demonstrate that the congruence $a^*_t(n) \equiv 0 \pmod t$ for self-conjugate partitions (where $t$ is even) is an immediate consequence of an addition theorem proved by the second author in a previous work. They further generalize this to odd $t$ by restricting the set to $BG_t$ (partitions in $SC$ where the $t$ -core's associated vector satisfies specific conditions). They establish the exact counting formula:
$a^*_t(n) = (t-1) \sum_{j \ge 1} |BG_t(n - 2jt)|$
which implies $a^*_t(n) \equiv 0 \pmod{t-1}$ for odd $t$ .
Extension to $z$ -Asymmetric Partitions:
The paper introduces an addition-multiplication theorem (Theorem 1.9) for the set $BG_{z,t}$ , a specific subset of $z$ -asymmetric partitions. This theorem provides a generating function identity involving formal power series $f_t$ and $g_t$ defined over all partitions, specialized to the subset $BG_{z,t}$ .
- Theorem 1.9 establishes a relationship between the generating function of hook lengths in $BG_{z,t}$ and products of $q$ -Pochhammer symbols.
- Corollary 1.10 derives a congruence result: the number of hooks of length $t$ in $BG_{z,t}$ , denoted $a_{z,t}(n)$ , satisfies:
  $a_{z,t}(n) \equiv 0 \pmod{2\lfloor (t-z)/2 \rfloor}$
- This result unifies and extends previous findings, recovering the self-conjugate case ( $z=0$ ) and the "doubled distinct" case ( $z=1$ ).
Specific Cases and Generating Functions:
- Doubled Distinct Partitions ( $DD = P_1$ ): The paper provides explicit generating functions and congruences for $DD$ partitions (where $z=1$ ), showing that for $t \ge 2$ , the number of hooks of length $t$ in the set $BG_{1,t}$ is divisible by $2\lfloor (t-1)/2 \rfloor$ .
- Modular Nekrasov–Okounkov Identity: The authors exhibit a modular version of the Nekrasov–Okounkov identity restricted to the set $BG_{z,t}$ , generalizing previous modular identities derived from the Littlewood decomposition.

Significance and Claims
The paper claims that its primary significance lies in providing a unified framework for deriving congruences for hook lengths. By leveraging the addition and multiplication theorems associated with the Littlewood decomposition, the authors show that:

Known congruences for self-conjugate partitions are not isolated phenomena but direct consequences of the underlying algebraic structure of the decomposition.
These results can be systematically extended to $z$ -asymmetric partitions, a class of partitions relevant to the representation theory of classical groups ( $O(2n, \mathbb{C})$ , $Sp(2n, \mathbb{C})$ , $SO(2n+1, \mathbb{C})$ ).
The restriction to the set $BG_{z,t}$ is necessary; the authors note that without these restrictions (e.g., considering the entire set $P_z$ ), such congruences generally do not hold for odd $t-z$ or specific even cases, as counterexamples exist where the count is 1.

The work does not propose new experimental applications but rather clarifies the combinatorial mechanisms behind existing number-theoretic properties of partitions, offering a more direct path to these results and expanding their scope to $z$ -asymmetric partitions.

1. The Special Towers: Self-Conjugate and "Z-Asymmetric"

2. The Magic Trick: The Littlewood Decomposition

3. The "Addition-Multiplication" Theorem

4. The Big Discovery: The "Divisible" Pattern

5. Why This Matters (According to the Paper)

More like this