← Latest papers
🔢 mathematics

Proof of a conjecture of Andrews and El Bachraoui on the parity of two-color partitions

This paper proves a conjecture by Andrews and El Bachraoui by demonstrating that if the Fourier coefficient to(n)t_o(n) of a specific two-color partition qq-series is odd, then the integer 8n+98n+9 can be represented by the binary quadratic form x2+2y2x^2+2y^2.

Original authors: Koustav Banerjee, Kathrin Bringmann

Published 2026-07-10
📖 3 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 have a giant, magical jar of colored blocks. You want to build towers using these blocks, but there are some very specific, quirky rules for how you can stack them. This is the world of "two-color partitions" that mathematicians Andrews and El Bachraoui were playing with. They asked a simple question: If you follow these rules to build a tower of a certain size, is the number of ways you can do it an odd number or an even number?

For a long time, they had a hunch—a guess, really—about when the answer would be an odd number. They suspected that the answer is only odd if a very specific mathematical condition is met involving a shape called a "binary quadratic form." Think of this form, x2+2y2x^2 + 2y^2, as a special lock. The hunch was: "You can only get an odd number of ways to build your tower if the number 8n+98n + 9 (where nn is your tower size) can fit perfectly into this lock."

In this paper, Koustav Banerjee and Kathrin Bringmann step in to settle the debate. They don't just guess; they prove it. They show that if the number of ways to build your tower is indeed odd, then 8n+98n + 9 must be representable by that special lock (x2+2y2x^2 + 2y^2).

Here is how they cracked the code:
They took the complex formula that describes all these tower-building possibilities and started rearranging it, like solving a giant, invisible puzzle. They broke the formula down into smaller, manageable pieces using some clever math tricks involving "q-series" (which are just fancy ways of writing down infinite lists of numbers).

As they peeled back the layers, they discovered that the "oddness" of the answer depends entirely on how these pieces fit together. They found that the pieces only align to create an odd result if the number 8n+98n + 9 can be written as a square number plus twice another square number.

To make this concrete, imagine 8n+98n + 9 is a treasure chest. The mathematicians proved that if the chest is locked with a key that doesn't fit the x2+2y2x^2 + 2y^2 pattern, the chest is empty (the answer is even, or zero). But if the chest does have a key that fits that pattern, then—surprise!—the chest might contain an odd number of treasures.

They didn't just say, "It looks like this works." They built a logical bridge, step-by-step, showing that if the condition isn't met, the answer is mathematically forced to be even. They even checked three different scenarios to make sure no sneaky exceptions were hiding in the shadows. In every case, the rule held up.

So, the mystery is solved. The guess made by Andrews and El Bachraoui wasn't just a lucky guess; it was a fact. If you see an odd number of ways to build these special two-color towers, you can be absolutely certain that 8n+98n + 9 fits the x2+2y2x^2 + 2y^2 pattern. If it doesn't fit, the number of ways is definitely even. The lock and the key match perfectly, and the proof is solid.

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 →