🔢 mathematics

On Four Conjectural Congruence Families for the Overpartition Function

This paper proves four Ramanujan-type congruence families for the overpartition function proposed by Xuanling Wei, utilizing advanced modular forms techniques to establish results modulo 7, 19, 17, and 23 while also deriving new Hecke identities and providing reproducible verifications.

Original authors: Sumit Jha

Published 2026-10-26

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Sumit Jha

Original paper licensed under CC BY 4.0 (https://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

In the vast landscape of number theory, mathematicians often study how whole numbers can be built by adding smaller whole numbers together. This process, called partitioning, is like asking how many different ways you can stack blocks to reach a specific height. For centuries, researchers have looked for hidden patterns in the answers to these questions, searching for rules that dictate when the count of possible arrangements is divisible by a specific number. One particularly fascinating variation involves "overpartitions," where the very first time a specific number appears in a stack, it is marked with a special line. This small change creates a new, more complex counting system that behaves differently than the standard version. The mystery lies in finding predictable rhythms within these counts, specifically identifying long sequences of numbers where the total count of arrangements is always divisible by a prime number like seven, seventeen, or nineteen. These patterns, known as congruence families, are rare and difficult to prove because they require showing that a rule holds true for an infinite number of cases without exception.

A researcher named Sumit Kumar Jha has now settled four long-standing guesses about these patterns, which were originally proposed by mathematician Xuanling Wei. Wei had suggested that specific sequences of overpartition counts would always be divisible by seven, seventeen, nineteen, and twenty-three under certain conditions, but he could not prove them. Jha's work confirms that these guesses were correct. He demonstrated that for the modulus seven, the counts of overpartitions for numbers following a specific pattern are indeed always divisible by seven. For the other moduli, the proof was more intricate, requiring the construction of a bridge between the overpartition counts and other advanced mathematical objects known as modular forms. These forms act like a filter, allowing the researcher to isolate the specific numbers in question and reveal their hidden divisibility properties.

The proof for the modulus seven was relatively direct, relying on a known method to check a finite list of numbers to confirm the rule for all numbers. However, the cases for seventeen, nineteen, and twenty-three were far more complex. For the modulus nineteen, the mathematical object describing the pattern initially appeared to have a flaw that made it impossible to analyze using standard tools. Jha solved this by building a new, perfect version of the object—a "holomorphic lift"—which smoothed out the flaw and allowed him to apply powerful algebraic techniques. This process is similar to taking a rough, uneven stone and carving it into a perfect sphere so that it can roll smoothly along a path that was previously blocked. Once this new version was created, he could use it to prove that the counts for nineteen followed a precise rule involving prime numbers.

For the moduli seventeen and twenty-three, the researcher connected the overpartition counts to famous mathematical series discovered by other mathematicians, specifically those related to Eisenstein series and cusp forms. These series are like established maps of the mathematical terrain. By showing that the overpartition counts matched these maps, Jha was able to prove that they followed the same rigid rules. He found that for seventeen, the counts are linked to a specific series that behaves predictably when multiplied by certain prime numbers. For twenty-three, the connection involved a more complex series that vanishes at specific points, creating a zero pattern that Jha proved must occur for the overpartition counts as well. In both cases, he derived new formulas that describe how the counts change when the input numbers are multiplied by squares of prime numbers, revealing a deep, structured relationship between the numbers.

The results are not just about confirming that these patterns exist; they also provide new, explicit formulas that describe how the counts behave. For instance, the paper shows exactly how the count for a number multiplied by the square of a prime number relates to the count of the original number. These formulas work for all odd prime numbers in specific contexts, offering a complete picture of the behavior of these overpartitions. The researcher did not rely on computer simulations alone to make these claims; instead, he used computers to perform exact, finite checks on thousands of specific numbers to verify the mathematical logic. These checks served as a final certificate, ensuring that the infinite rules he derived were grounded in concrete reality. The work stands as a definitive proof that the four families of patterns proposed by Wei are real, closing a chapter of uncertainty and adding four new, solid pillars to the understanding of overpartitions.

Technical Summary: On Four Conjectural Congruence Families for the Overpartition Function

Problem Statement
This paper addresses four specific conjectures regarding congruence families for the overpartition function $p(n)$ , originally proposed by Xuanling Wei. An overpartition of $n$ allows the first occurrence of each distinct part to be overlined. Wei had previously established congruences modulo 11 and 13 and proposed four additional families involving moduli 7, 17, 19, and 23. The central problem is to rigorously prove these four conjectural families and to derive associated Hecke identities and restricted congruences that were not explicitly stated in the original proposals.

Methodology
The proofs employ a synthesis of classical modular form theory, finite verification criteria, and computational algebra. The methodology is structured around four distinct approaches tailored to the specific arithmetic properties of each modulus:

Radu–Sellers Finite Criterion (Modulus 7): For the modulus 7, the paper utilizes the Radu–Sellers criterion for eta-products. This involves verifying a finite set of admissibility conditions, checking cusp inequalities at specific representatives, and performing a finite coefficient verification up to a calculated Sturm bound.
Cohen–Eisenstein Decomposition (Modulus 17): For modulus 17, the generating function is related to Cohen's Eisenstein series of weight $15/2$ . The proof establishes an exact polynomial identity between the extracted overpartition series and Cohen's series over $\mathbb{Q}$ . This allows the application of Hecke operator theory and Sturm's theorem to derive congruences and recurrence relations.
Polynomial Holomorphic Lift (Modulus 19): The modulus 19 case is the most technically distinct. The initial extraction yields a weakly holomorphic modular form. The author constructs an explicit "polynomial holomorphic lift" using Serre derivatives and the ring of modular forms on $\Gamma_0(4)$ . This transforms the weakly holomorphic series into a holomorphic form of weight $399/2$ , enabling the application of standard Hecke and Sturm arguments.
Kohnen–Shimura Correspondence (Modulus 23): For modulus 23, the proof relies on the Kohnen–Shimura correspondence. The extracted series is decomposed into an Eisenstein part and a cusp form part. The cusp form is identified with the Shimura lift of the weight-20 cusp form $\Delta E_8$ . This identification allows the derivation of explicit Hecke eigenvalues and congruence families.

Throughout, the paper relies on finite coefficient verifications (Sturm bounds) to convert local identities into global congruences. These verifications are supported by reproducible source code (C++17 and Python) that performs exact arithmetic, including Newton inversion and Number Theoretic Transforms (NTT).

Key Contributions and Results
The paper provides complete proofs for Wei's four conjectures and extends them with new identities:

Theorem 1.1 (Modulo 7): Proves Wei's Conjecture 4.1, establishing that $p(896n + 176)$ , $p(896n + 688)$ , and $p(896n + 816)$ are all congruent to 0 modulo 7. This is equivalent to $p(16m) \equiv 0 \pmod 7$ under specific quadratic residue conditions.
Theorem 1.2 (Modulo 17): Proves a congruence relating $p(17m)$ to Cohen's Eisenstein series $H(7, m)$ . It further derives a restricted Hecke identity for odd primes $Q$ and identifies infinite families of vanishing coefficients (e.g., $p(17 \cdot 11^2 m) \equiv 0 \pmod{17}$ under specific conditions).
Theorem 1.3 (Modulo 19): Proves Wei's Conjecture 4.2 and establishes new Hecke identities for $a(m) = p(4m)$ modulo 19 involving primes 13 and 17. The proof necessitates the construction of the holomorphic lift $B_{19}$ to handle the weakly holomorphic nature of the original series.
Theorem 1.4 (Modulo 23): Proves a congruence for $p(23m)$ involving both Cohen's Eisenstein series $H(10, m)$ and a specific cusp form $S$ (related to $\Delta E_8$ ). It derives a general Hecke identity for odd primes $Q$ and identifies specific prime-power towers where the coefficients vanish.

Significance and Claims
The paper claims to provide the first rigorous proofs of Wei's four proposed congruence families. Its significance lies in:

Unification: Demonstrating that seemingly disparate conditions for moduli 7, 17, 19, and 23 share a common explanation rooted in the Hecke action on quadratic-character components of overpartition generating series.
Methodological Advancement: Specifically for modulus 19, the work introduces a "polynomial holomorphic lift" technique to convert a weakly holomorphic modular form into a holomorphic one, a necessary step to apply standard Hecke and Sturm arguments.
Explicit Identities: Beyond proving the congruences, the paper derives explicit Hecke identities and recurrence relations for prime-power towers, offering a deeper structural understanding of the overpartition function's behavior modulo these primes.
Reproducibility: The author emphasizes the role of finite verification, providing complete modularity hypotheses and source code to ensure the infinite identities are grounded in exact, reproducible finite checks.

The paper modestly frames its results as specific resolutions of Wei's proposals using classical tools (Cohen series, Shimura correspondence) and finite criteria, rather than claiming to discover entirely new theoretical frameworks or applications beyond the scope of these congruences.

More like this