---
title: 2-Core Towers in Integer Partitions
url: https://www.emergentmind.com/topics/2-core-towers
type: topic
---

# 2-Core Towers in Integer Partitions

A 2-core tower is a recursive combinatorial and algebraic structure associated with integer partitions, in which each partition is decomposed into its 2-core and a collection of 2-quotients, and this process is iteratively applied to the quotients themselves. The theory of 2-core towers provides refined enumeration results, explicit generating functions, and asymptotics for statistics such as the total 2-core size and the 2-defect of partitions. This structure also intersects representation theory, modular forms, and arithmetic geometry, as evidenced by its connections to class field theory and modular partition congruence phenomena [1509.06620].

## 1. The 2-Core and 2-Core Tower Construction

Given an integer partition $\lambda=(\lambda_1 \ge \lambda_2 \ge \dots \ge 0)$, its Young diagram defines hook-lengths for each cell. The 2-core $\lambda^{(2)}$ of $\lambda$ is the partition obtained by iteratively removing all hooks of even length, regardless of order, until only hooks of odd length remain. This process terminates with a unique 2-core for every partition. The construction of the 2-core tower begins with the partition itself (row 0), followed by its 2-quotient—a pair of partitions (row 1)—where the original partition is uniquely reconstructed from its 2-core and 2-quotient. The procedure continues recursively: each partition in row $j$ gives rise to two partitions in row $j+1$, generating a binary-tree-like structure. Formally, if $a_j(\lambda)$ denotes row $j$ of the pre-tower and $B_j(\lambda)$ the sequence of 2-cores of the partitions in $a_j(\lambda)$, then $B_0(\lambda)=\lambda^{(2)}$ and $B_1(\lambda)$ is the pair of 2-cores of the 2-quotient of $\lambda$ [1509.06620].

## 2. Generating Functions for Row Sizes in 2-Core Towers

Let $|B_j(\lambda)|$ denote the total size (sum of parts) of all partitions in the $j$th row of the 2-core tower of $\lambda$, and $\mathcal{P}$ the set of all partitions. The associated generating function is defined as
$$
T_{j,2}(q) = \sum_{\lambda \in \mathcal{P}} |B_j(\lambda)| q^{|\lambda|}.
$$
The closed formula for $T_{j,2}(q)$ is
$$
T_{j,2}(q) = \frac{G_2(q) - 2^{j+1} G_2(q^{2^{j+1}})}{(q)_\infty},
$$
where $(q)_\infty = \prod_{n \geq 1} (1-q^n)$ and $G_2(q) = \sum_{n\geq 1} \sigma_1(n) q^n$ with $\sigma_1(n) = \sum_{d|n} d$ the sum of divisors. For $j=0$, this gives the generating function for the total size of the 2-cores among all partitions:
$$
T_{0,2}(q) = \frac{G_2(q) - 2 G_2(q^2)}{(q)_\infty}.
$$
These identities follow directly from the $t$-core tower theory specialized to $t=2$ [1509.06620].

## 3. The 2-Defect and Its Asymptotics

The 2-defect $d_2(\lambda)$ of a partition $\lambda$ is defined as
$$
d_2(\lambda) = |\lambda| - \sum_{j \geq 0} 2^j |B_j(\lambda)|,
$$
which for $t = 2$ aligns with the defect notion in the modular representation theory of $S_n$. The generating function
$$
D_2(q) = \sum_{\lambda \in \mathcal{P}} d_2(\lambda) q^{|\lambda|}
$$
satisfies
$$
D_2(q) = \frac{\sum_{n \geq 1} n p(n) q^n}{(q)_\infty} = \frac{G_2(q)}{(q)_\infty^2},
$$
where $p(n)$ is the partition function. By asymptotic analysis via Ingham's Tauberian theorem, it follows
$$
\sum_{|\lambda|=n} d_2(\lambda) \sim n \cdot p(n),
$$
so that the expected size of the 2-defect for a partition of $n$ is asymptotic to $n$ as $n \to \infty$ [1509.06620].

## 4. Congruences and Identities Involving 2-Core Towers

Let $a_2(n) = \sum_{|\lambda|=n} |B_0(\lambda)| = \sum_{|\lambda|=n} |\lambda^{(2)}|$ denote the total size of all 2-cores among partitions of $n$. This function satisfies the congruence
$$
a_2(n) \equiv n p(n) \pmod{4}, \qquad a_2(2n) \equiv 0 \pmod{4}.
$$
Furthermore, $a_2(n)$ satisfies a recursion involving the number $p_2(n)$ of 2-regular partitions (partitions with no even part):
$$
a_2(n) = n p(n) - 2 \sum_{j=0}^n 2^j j p_2(n-j).
$$
Because $T_{0,2}(q)$ is constructed from Eisenstein-series components, it is congruent modulo powers of primes $\geq 5$ to half-integral weight modular forms, implying the presence of additional Ramanujan-type congruences for the sum of 2-core sizes [1509.06620].

## 5. Relation to General $t$-Core Tower Theory

The 2-core tower theory is a specialization of the general $t$-core tower framework. Theorem 2.1 in Rolen's work asserts that every partition is uniquely reconstructed from its $t$-core and $t$-quotient, and iteration yields the full $t$-core pre-tower. The weighted sum $\sum_{\lambda}|B_j(\lambda)|q^{|\lambda|}$ for the $j$th row has the form
$$
T_{j,t}(q) = \frac{G_2(q) - t^{j+1} G_2(q^{t^{j+1}})}{(q)_\infty},
$$
specializing to $t=2$ gives the formulas for the 2-core case. The $t$-defect generating function is
$$
D_t(q) = \frac{(t-1)\sum_{n\geq 1} n p(n) q^n}{(q)_\infty}.
$$
Consequently, all properties of the 2-core tower (explicit generating functions, defects, asymptotics, and congruences) are instances of these general results with $t=2$. The analytic formulas rely on the partition generating function, the sum-of-divisors function, and modular forms identities [1509.06620].

## 6. Interconnections and Significance in Representation Theory and Number Theory

The structure of the 2-core tower arises naturally in several areas. In the representation theory of symmetric groups, the $t$-defect coincides with standard defect statistics for primes, and the unique decomposition of a partition into its $t$-core and $t$-quotient underlies combinatorial constructions such as the modular branching rules. In number theory, the generating functions and congruence formulas for rows and sizes of 2-core towers link with modular forms and Ramanujan-type congruences. The general approach, grounded in $q$-series, Eisenstein series, and Tauberian analysis, demonstrates the depth and generality of the $t$-core tower perspective and serves as a model for analogous results in $p$-modular combinatorics [1509.06620].

Source: https://www.emergentmind.com/topics/2-core-towers