New Ramanujan-type congruences for overpartitions modulo $11$and$13$

This paper establishes two new Ramanujan-type congruences for the overpartition function modulo 11 and 13 using the theory of modular forms, while also conjecturing similar results for other prime moduli.

The Gist

Imagine you have a giant pile of LEGO bricks. You want to build towers using all of them. A partition is just one way to stack those bricks. For example, if you have 3 bricks, you could stack them as a single tower of 3, or a tower of 2 with a 1 on top, or three towers of 1.

Now, imagine a special version of this game called Overpartitions. In this version, the very first time you use a specific number of bricks in a stack, you can paint that specific stack a different color (or "overline" it). This tiny rule change creates a whole new universe of ways to build your towers. Mathematicians call the number of ways to do this the overpartition function, denoted as $\bar{p}(n)$.

For over 100 years, mathematicians have been fascinated by a pattern discovered by the genius Srinivasa Ramanujan. He noticed that if you look at certain specific numbers of bricks, the number of ways to build them is always perfectly divisible by a prime number (like 5, 7, or 11). It's like saying, "If you have 9 bricks, no matter how you try to build them, the total number of unique designs will always be a multiple of 5."

The Big Discovery in This Paper

The author of this paper, Xuanling Wei, is like a detective who found two new, hidden patterns in the world of these "colored" LEGO towers. Specifically, she proved that for two very specific types of brick counts, the number of designs is always divisible by 11 and 13.

Here is the simple breakdown of her two main findings:

1. The Rule of 11: If you take a number of bricks that fits the formula $11 \times (8n + 5)$(where$n$ is any whole number like 0, 1, 2...), the number of ways to overpartition them is always a multiple of 11.

   • Analogy: Imagine a secret club where the entry fee is 11. Wei proved that if you bring a specific type of brick count to the door, the number of people trying to enter is always exactly divisible by 11, leaving no one left over.

2. The Rule of 13: Similarly, if you use a number of bricks fitting the formula $13 \times 26 \times (8n + 7)$, the number of designs is always a multiple of 13.

How Did She Do It? (The Magic Toolbox)

You might wonder, "How do you prove something about infinite numbers of LEGO towers?" You can't just count them all; there are too many!

Wei used a powerful mathematical tool called Modular Forms. Think of this as a "magic telescope" or a "frequency analyzer."

• In the world of numbers, these forms are like complex musical chords.
• When you play a specific chord (a modular form), it vibrates in a way that reveals hidden symmetries in the numbers.
• Wei took the "song" of the overpartitions, applied a special filter (using the math of these modular forms), and listened for a specific rhythm.
• She found that when she looked at the numbers through this telescope, the "noise" for the specific numbers she was interested in (the ones divisible by 11 or 13) completely vanished. In math terms, the remainder was zero.

The "Guessing Game" (Conjectures)

After proving these two rules, Wei looked at her data and saw other patterns that looked like they should be true, but she couldn't prove them yet with her current tools. It's like finding a map with a few missing pieces.

She is now guessing (conjecturing) that similar rules exist for other prime numbers like 7, 17, 19, and 23.

• She has a strong hunch that if you pick the right "brick counts" for these numbers, the designs will always be divisible by them.
• However, proving these new rules would require a much bigger telescope (more complex computation) than the one she used for 11 and 13. She has done the math to show where to look, but the final verification is a massive computational task that hasn't been finished yet.

Why Does This Matter?

You might ask, "Who cares about counting LEGO towers?"

While it seems like a game, this is actually about understanding the fundamental structure of numbers. Ramanujan's original discoveries changed how we understand the universe of mathematics. By finding these new "Ramanujan-type" congruences for overpartitions, Wei is:

1. Expanding the Map: Showing us that these beautiful, hidden symmetries exist in more places than we thought.
2. Connecting Ideas: Linking the world of simple counting (partitions) with the deep, abstract world of modular forms (the "music" of numbers).
3. Setting the Stage: Her work provides the blueprint for future mathematicians to solve the even harder puzzles she has left behind.

In short, Xuanling Wei found two new "secret codes" in the infinite library of numbers, proving that even in a chaotic world of counting, there are strict, beautiful rules waiting to be discovered.

Technical Summary

Here is a detailed technical summary of the paper "New Ramanujan-Type Congruences for Overpartitions Modulo 11 and 13" by Xuanling Wei.

1. Problem Statement

The paper addresses the existence and proof of Ramanujan-type congruences for the overpartition function, denoted as $\bar{p}(n)$.

• Context: An overpartition of an integer $n$ is a partition where the first occurrence of each distinct part may be overlined. This generalizes the standard partition function $p(n)$.
• Goal: The author seeks to establish congruences of the form $\bar{p}(an + b) \equiv 0 \pmod m$, specifically for moduli $m=11$ and $m=13$, where the coefficient $a$ is even. While such congruences are well-studied for $p(n)$ (Ramanujan's original work) and some cases for $\bar{p}(n)$ (e.g., modulo 3, 5, 7), new families for moduli 11 and 13 with even multipliers were previously unproven.

2. Methodology

The proofs rely heavily on the theory of modular forms, specifically utilizing the interplay between integral and half-integral weight forms. The core methodological steps include:

• Generating Functions: The generating function for overpartitions is expressed using the Ramanujan theta function $\phi(q)$ and the Dedekind eta function $\eta(z)$:
  $$\sum_{n=0}^\infty \bar{p}(n)q^n = \frac{(q^2; q^2)_\infty}{(q; q)_\infty^2} = \frac{1}{\phi(-q)}$$
• Modular Forms Framework:
  • The author utilizes the space of modular forms $M_k(\Gamma_0(N), \chi)$ and half-integral weight forms $M_{k/2}(\Gamma_0(4N), \chi)$.
  • A basis for these spaces is constructed using eta-quotients and powers of $\phi(q)$ and a specific function $F(q) = \eta(4z)^8 / \eta(2z)^4$.
• Hecke Operators and Reduction:
  • The proof involves multiplying the generating function by high powers of $\phi(q)$ (specifically $\phi(q)^{11}$ and $\phi(q)^{13}$) to utilize the property $\phi(q)^p \equiv \phi(q^p) \pmod p$ (derived from Lemma 1.4).
  • Hecke Operators ($T_k(\ell)$): The author applies Hecke operators to extract specific arithmetic progressions. For a form $f$, the action of $T(\ell)$ isolates coefficients $a(\ell n)$.
  • Operator $U(d)$ and Twisting: To isolate terms of the form $an+b$, the author employs the $U(d)$ operator (which maps $q^n \to q^{n/d}$) and Dirichlet character twists. This allows the extraction of coefficients where the index satisfies specific congruence conditions (e.g., $n \equiv b \pmod A$).
• Sturm's Theorem:
  • To prove that a modular form is identically zero modulo $p$, the author uses Sturm's Theorem. This theorem states that if two modular forms agree on their Fourier coefficients up to a specific bound (determined by the weight and level), they are congruent modulo $p$ for all coefficients.
  • This reduces the infinite verification of the congruence to a finite, computable check of coefficients.

3. Key Contributions and Results

The paper establishes two main theorems providing new infinite families of congruences for overpartitions:

Theorem 1.1 (Main Results)

For all integers $n \geq 0$:

1. Modulo 11:
   $$\bar{p}(11(8n + 5)) \equiv 0 \pmod{11}$$

   • Proof Sketch: The author shows that the generating function for $\bar{p}(11n)$, when manipulated via Hecke operators and reduced modulo 11, results in a modular form in $M_{9/2}(\Gamma_0(4))$. By applying character twists to isolate indices $8n+5$, the resulting form is shown to have coefficients divisible by 11 up to the Sturm bound, proving the congruence.

2. Modulo 13:
   $$\bar{p}(13 \times 26(8n + 7)) \equiv 0 \pmod{13}$$

   • Note: The multiplier is $13 \times 26 = 338$.
   • Proof Sketch: Similar to the modulo 11 case, the author works with $\phi(q)^{13}$. The resulting form lies in $M_{11/2}(\Gamma_0(4))$. The author applies the $U(2)$ operator six times (equivalent to $U(26)$) and uses character twists to isolate indices $26(8n+7)$. Verification up to the Sturm bound confirms the congruence.

Conjectures

The paper also proposes several new conjectural congruences based on numerical computations, which are expected to be provable using similar methods but require extensive computation:

• Modulo 17: $\bar{p}(17 \times 11^2 n) \equiv 0 \pmod{17}$ for specific conditions on $n$ (related to Legendre symbols).
• Modulo 23: $\bar{p}(23 \times 13^2 n) \equiv 0 \pmod{23}$ for specific conditions on $n$.
• Modulo 7, 19: Additional conjectures involving complex residue classes (e.g., $\bar{p}(24n) \equiv 0 \pmod 7$ under specific conditions).

4. Significance

• Extension of Ramanujan's Legacy: The paper extends the classical theory of partition congruences (originally discovered by Ramanujan for $p(n)$) to the more complex setting of overpartitions, specifically addressing moduli 11 and 13 which had not been fully explored with even multipliers in this specific form.
• Methodological Rigor: It demonstrates the power of combining Hecke operators, eta-quotients, and Sturm's theorem to prove congruences for half-integral weight modular forms.
• New Families of Congruences: The results provide explicit, infinite families of congruences ($\bar{p}(an+b) \equiv 0$) where the multiplier $a$ is even, a specific case noted as less common than odd multipliers in previous literature.
• Future Directions: The paper sets a precedent for investigating higher moduli (17, 19, 23) and highlights the computational limits of current methods, suggesting that while the theoretical framework exists, the sheer scale of verification for higher moduli remains a challenge.

In summary, Wei's paper successfully proves two significant new congruences for overpartitions using advanced modular form theory, while simultaneously mapping out a landscape of further conjectures for the mathematical community to explore.