2-Core Towers in Integer Partitions

• 2-Core Towers are recursive combinatorial structures that decompose integer partitions into a unique 2-core and iteratively derived 2-quotients.
• They provide explicit generating functions and congruences that quantify 2-core sizes and reveal the asymptotic behavior of partition statistics.
• Their interconnections with modular forms and representation theory shed light on modular partition congruences and p-modular combinatorics.

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 (Rolen, 2015).

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 $\lambda^{(2)}$0 is the pair of 2-cores of the 2-quotient of $\lambda^{(2)}$1 (Rolen, 2015).

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

Let $\lambda^{(2)}$2 denote the total size (sum of parts) of all partitions in the $\lambda^{(2)}$3th row of the 2-core tower of $\lambda^{(2)}$4, and $\lambda^{(2)}$5 the set of all partitions. The associated generating function is defined as

$\lambda^{(2)}$6

The closed formula for $\lambda^{(2)}$7 is

$\lambda^{(2)}$8

where $\lambda^{(2)}$9 and $\lambda$0 with $\lambda$1 the sum of divisors. For $\lambda$2, this gives the generating function for the total size of the 2-cores among all partitions:

$\lambda$3

These identities follow directly from the $\lambda$4-core tower theory specialized to $\lambda$5 (Rolen, 2015).

3. The 2-Defect and Its Asymptotics

The 2-defect $\lambda$6 of a partition $\lambda$7 is defined as

$\lambda$8

which for $\lambda$9 aligns with the defect notion in the modular representation theory of $j$0. The generating function

$j$1

satisfies

$j$2

where $j$3 is the partition function. By asymptotic analysis via Ingham's Tauberian theorem, it follows

$j$4

so that the expected size of the 2-defect for a partition of $j$5 is asymptotic to $j$6 as $j$7 (Rolen, 2015).

4. Congruences and Identities Involving 2-Core Towers

Let $j$8 denote the total size of all 2-cores among partitions of $j$9. This function satisfies the congruence

$j+1$0

Furthermore, $j+1$1 satisfies a recursion involving the number $j+1$2 of 2-regular partitions (partitions with no even part):

$j+1$3

Because $j+1$4 is constructed from Eisenstein-series components, it is congruent modulo powers of primes $j+1$5 to half-integral weight modular forms, implying the presence of additional Ramanujan-type congruences for the sum of 2-core sizes (Rolen, 2015).

5. Relation to General $j+1$6-Core Tower Theory

The 2-core tower theory is a specialization of the general $j+1$7-core tower framework. Theorem 2.1 in Rolen's work asserts that every partition is uniquely reconstructed from its $j+1$8-core and $j+1$9-quotient, and iteration yields the full $a_j(\lambda)$0-core pre-tower. The weighted sum $a_j(\lambda)$1 for the $a_j(\lambda)$2th row has the form

$a_j(\lambda)$3

specializing to $a_j(\lambda)$4 gives the formulas for the 2-core case. The $a_j(\lambda)$5-defect generating function is

$a_j(\lambda)$6

Consequently, all properties of the 2-core tower (explicit generating functions, defects, asymptotics, and congruences) are instances of these general results with $a_j(\lambda)$7. The analytic formulas rely on the partition generating function, the sum-of-divisors function, and modular forms identities (Rolen, 2015).

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 $a_j(\lambda)$8-defect coincides with standard defect statistics for primes, and the unique decomposition of a partition into its $a_j(\lambda)$9-core and $j$0-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 $j$1-series, Eisenstein series, and Tauberian analysis, demonstrates the depth and generality of the $j$2-core tower perspective and serves as a model for analogous results in $j$3-modular combinatorics (Rolen, 2015).