← Latest papers
🔢 mathematics

Proof of a conjecture of Andrews and Bachraoui on a Hecke sum

This paper proves a conjecture by Andrews and Bachraoui that connects a generating function for specific two-color partitions to a Hecke-type double sum, utilizing Zwegers' theory of indefinite theta functions and the modular properties of mock theta functions.

Original authors: Koustav Banerjee, Kathrin Bringmann

Published 2026-05-12
📖 5 min read🧠 Deep dive

Original authors: Koustav Banerjee, Kathrin Bringmann

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 are trying to solve a massive, intricate puzzle where the pieces are numbers. In the world of mathematics, specifically in a field called number theory, researchers often look at "partitions." Think of a partition as breaking a whole number (like 10) into a sum of smaller numbers (like 5 + 3 + 2).

This paper is about two mathematicians, Koustav Banerjee and Kathrin Bringmann, who finally solved a specific puzzle proposed by their colleagues, George Andrews and Bachraoui.

Here is the story of their discovery, broken down into simple concepts:

1. The Puzzle: Two-Color Partitions

Imagine you have a bag of blocks. Some are Blue and some are Red. You want to build a tower using these blocks to reach a specific height (the number nn).

The rules for building this tower are very strict:

  • The very bottom block must be Blue and its size must be an odd number.
  • If you use a Blue block that is an even number, it must be much taller than the bottom block (at least 2k12k-1 units taller).
  • You cannot have two blocks of the same color and the same size (they must be distinct).

The mathematicians wanted to know: How many different ways can you build these towers for any given height? They created a special formula (a "generating function") to count these possibilities.

2. The Mystery: A Hidden Connection

Andrews and Bachraoui noticed something strange. As they made the rules for the "Blue" blocks more and more strict (letting kk go to infinity), the number of ways to build the towers seemed to settle down into a specific pattern.

They made a Conjecture (a guess that they believed was true but hadn't proven yet). They claimed that this complex counting formula was secretly equal to something completely different: a "Hecke-type double sum."

Think of it like this: You have a recipe for a cake (the partition counting) and a recipe for a soup (the double sum). They look totally different, use different ingredients, and are cooked in different pots. But the conjecture claimed that if you taste them, they are actually the exact same flavor.

3. The Problem: The Ingredients Don't Match

The problem was that these two formulas weren't behaving nicely. In the world of math, some formulas are "holomorphic," meaning they are smooth and predictable. Others are "mock" or "indefinite," meaning they are a bit wobbly and don't follow the standard rules of symmetry that mathematicians love.

The two sides of the equation (the cake and the soup) were wobbly in different ways. You couldn't just compare them directly because they were "broken" in different places.

4. The Solution: The "Completion" Trick

Banerjee and Bringmann used a powerful tool developed by a mathematician named Sander Zwegers. Think of Zwegers' theory as a repair kit or a scaffolding.

  • The Scaffolding: They took both the "cake" formula and the "soup" formula and added extra, non-smooth pieces to them. This process is called "completing" the functions.
  • The Result: Once they added these extra pieces, both formulas transformed into perfect, smooth, symmetrical objects called modular forms. Now, they were both standing on the same solid ground.
  • The Cancellation: Here is the magic part. When they compared the two "completed" formulas, they realized that the extra pieces they added (the scaffolding) were actually identical but with opposite signs. They canceled each other out perfectly.

5. The Final Proof: Sturm's Theorem

Now that the two formulas were proven to be "sisters" (both are modular forms of the same type), the mathematicians needed to prove they were identical twins.

They used a famous rule called Sturm's Theorem.

  • The Analogy: Imagine you have two long songs. To prove they are the exact same song, you don't need to listen to the whole hour. You only need to check the first few notes. If the first few notes match, and the songs follow the same musical rules (modular properties), then the entire songs must be the same.
  • The Execution: The authors calculated the first few numbers (Fourier coefficients) of their formulas. They matched perfectly. Because the rules of the game (Sturm's Theorem) said that matching these few numbers is enough, the proof was complete.

The Conclusion

The paper proves that the complex way of counting these two-color partitions is indeed exactly equal to the mysterious double sum formula.

In short:

  1. They had two different-looking mathematical formulas.
  2. They "fixed" both formulas by adding temporary scaffolding to make them symmetrical.
  3. They showed the scaffolding canceled out.
  4. They checked the first few numbers and saw they matched.
  5. Therefore, the two formulas are identical, confirming the original guess.

The paper ends by asking a few questions for the future, such as whether other parts of these mathematical structures have similar "real-world" counting meanings, but for now, the main puzzle is solved.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →