🔢 mathematics

Weighted partitions with interval restrictions: exact formulas and a bivariate master identity

This paper proves two conjectures regarding the signed partition functions $a_2''(n)$ and $b_2''(n)$ by establishing a bivariate master identity that yields closed-form generating functions, a false theta series representation, and an exact coefficient description showing that $b_2''(n)$ takes only values in $\{-1, 0, 1, 2\}$ .

Original authors: George E. Andrews, Mohamed El Bachraoui, Aritram Dhar, Ankush Goswami, Runqiao Li

Published 2026-06-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: George E. Andrews, Mohamed El Bachraoui, Aritram Dhar, Ankush Goswami, Runqiao Li

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, infinite box of building blocks. These blocks come in different sizes (1, 2, 3, 4, etc.), and your job is to build towers by stacking them. In mathematics, this is called "partitioning" a number: breaking a number down into a sum of smaller numbers.

This paper is like a detective story where mathematicians (George Andrews and his team) are investigating two very specific, slightly quirky rules for building these towers. They wanted to see what happens when you apply a special "weight" to the towers—basically, giving some towers a positive score and others a negative score based on how they are built.

Here is the breakdown of their discovery in everyday terms:

The Two Special Rules

The researchers were looking at two specific ways to build towers:

The "Strict" Rule (Family A): You must have a certain number of tiny "1" blocks at the bottom. The smallest "even" block you use (like a 2, 4, or 6) sets a floor. All other blocks must be bigger than that floor but smaller than a specific ceiling.
The "Loose" Rule (Family B): This is almost the same as the Strict Rule, but the ceiling is raised by just one block size.

The twist? They didn't just count the towers. They gave them a score. If a tower had an odd number of "big" blocks (anything bigger than 1), it got a negative score. If it had an even number, it got a positive score. They wanted to know: What is the total score for every possible tower size?

The Big Surprise: The "Master Key"

The authors found that these two families of towers are secretly connected by a "Master Key" (a mathematical formula involving a variable they called z).

Think of z as a dial on a machine.

When you turn the dial to a specific setting, the machine tells you the total score for the "Strict" towers.
When you turn it to another setting, it tells you the score for the "Loose" towers.
The "Master Key" is a single equation that links these two settings together. It's like finding a universal remote that controls two different TVs at once.

Solving the Mysteries

Before this paper, there were two guesses (conjectures) about what these scores would look like. The authors used their Master Key to prove both guesses were correct.

Mystery 1: The "False Theta" Pattern
For the "Strict" towers, the scores followed a very strange, jagged pattern that mathematicians call a "false theta series."

The Analogy: Imagine a heartbeat monitor that usually goes up and down smoothly. But for these towers, the heartbeat skips a beat, jumps, and then pauses in a very specific, repeating rhythm.
The Result: The authors proved that this chaotic-looking pattern is actually perfectly predictable. It follows a simple rule based on whether the tower size is odd or even, and where it falls in a triangular sequence.

Mystery 2: The "Tiny Score" Limit
For the "Loose" towers, the researchers guessed that the scores would never get very big or very small. They thought the score would always be stuck between -1, 0, 1, and 2.

The Analogy: Imagine a game where you can win or lose points, but the rules are so tight that you can never win more than 2 points or lose more than 1 point, no matter how long you play.
The Result: They proved this was true! The scores for the "Loose" towers are incredibly stable. They never explode into huge numbers; they stay tiny and contained.

How They Did It (The Detective Work)

The team used two different detective methods to solve the case:

Analytic Proof: They used heavy-duty algebra and calculus (like using a super-computer to crunch numbers) to show the formulas work.
Combinatorial Proof: They used logic and "pairing" tricks. Imagine you have a pile of "Strict" towers and a pile of "Loose" towers. They showed that for almost every tower in one pile, there is a matching tower in the other pile that cancels it out (one positive, one negative). The only towers left over are a very small, specific group that explains the final result.

The "Quantum" Connection

Finally, the paper mentions that this strange, jagged pattern (the "false theta") is related to something called "quantum modular forms."

The Analogy: In physics, quantum mechanics deals with things that behave strangely and unpredictably. In math, these "quantum modular forms" are functions that behave strangely when you try to plug in certain numbers. The authors showed that their tower-building scores are actually a type of these "quantum" objects, linking their simple block-stacking game to deep, complex theories in modern physics and number theory.

Summary

In short, this paper took two very specific, complicated rules for stacking blocks, found a hidden connection between them, and proved that the resulting scores are surprisingly simple and predictable. They solved two long-standing puzzles in the world of numbers, showing that even in the most rigid mathematical structures, there is a hidden order and a beautiful, simple rhythm.

Technical Summary: Weighted Partitions with Interval Restrictions: Exact Formulas and a Bivariate Master Identity

Problem Statement
This paper addresses two conjectures regarding signed partition functions, $a''_2(n)$ and $b''_2(n)$ , introduced by Andrews and El Bachraoui in a prior study [3]. These functions count partitions of an integer $n$ subject to specific interval restrictions on the parts, weighted by $(-1)^{j+1}$ , where $j$ is the number of parts greater than 1.

$a''_2(n)$ : Counts partitions with $l-1$ ones, smallest even part $2k$ , parts $>1$ in $[2k, 2l-2]$ , and distinct odd parts $>1$ .
$b''_2(n)$ : Similar to $a''_2(n)$ but with an enlarged interval $[2k, 2l-1]$ .

The conjectures posited that:

The generating function for $a''_2(n)$ admits a "triangular false theta" description involving periodic signs.
The coefficients $b''_2(n)$ are confined strictly to the set $\{-1, 0, 1, 2\}$ .

Methodology
The authors employ a dual approach combining analytic techniques and combinatorial bijections to prove these conjectures.

Bivariate Generalization: The central methodological innovation is the introduction of an auxiliary variable $z$ to track the number of non-compulsory parts greater than 1. This leads to the definition of bivariate generating functions $A(z, q)$ and $B(z, q)$ . The original signed functions are recovered via the specialization $z = -1$ .
Analytic Proofs: The authors derive closed forms for $A(z, q)$ and $B(z, q)$ using identities involving basic hypergeometric series, specifically the identity of Andrews, Subbarao, and Vidyasagar [4] and the Rogers–Fine identity. These derivations establish a "Master Identity" relating $A(z, q)$ and $B(z, q)$ .
Combinatorial Proofs: The paper provides bijective proofs for the generating function identities.
- For the individual functions, bijections map pairs of partitions to the respective generating series.
- For the Master Identity, a sign-reversing involution is constructed on augmented partition objects. This involution pairs most terms from the $A$ and $B$ families, leaving a specific "boundary family" of unpaired objects that corresponds exactly to the correction term in the identity.
Specialization and Evaluation: By setting $z = -1$ in the Master Identity and applying the Rogers–Fine identity, the authors evaluate the false theta series explicitly. A separate direct proof using Heine's transformation is also provided to verify the false theta formula for $a''_2(n)$ independently of the Master Identity.

Key Contributions and Results

The Master Identity: The paper establishes the fundamental relation:
$(1 + q^2)B(z, q) - (1 + q)A(z, q) = -\frac{q^4}{1 - q^3}$
This identity unifies the study of both partition families and controls their ordinary, signed, and fixed-refinement generating functions.
Proof of Conjecture 1 (False Theta Formula): The authors prove that the generating function for $a''_2(n)$ is:
$\sum_{n \ge 0} a''_2(n)q^n = \frac{q}{1-q^2} + \frac{1}{1+q} \sum_{n \ge 0} \chi(n)q^{\binom{n+1}{2}+1}$
where $\chi(n)$ is a periodic sign function. This confirms the "triangular false theta" structure and provides a simple parity rule determining $a''_2(n)$ .
Proof of Conjecture 2 (Coefficient Range): The paper derives an explicit generating function for $b''_2(n)$ :
$\sum_{n \ge 0} b''_2(n)q^n = \frac{q + q^2 + q^3 - q^4}{(1-q)(1+q^2)(1+q+q^2)} + \frac{q}{1+q^2} \sum_{n \ge 0} \chi(n)q^{\binom{n+1}{2}}$
By analyzing the rational part and the false theta contribution, the authors demonstrate that $b''_2(n) \in \{-1, 0, 1, 2\}$ for all $n$ , confirming the conjecture. Furthermore, they provide an exact coefficient formula for $b''_2(n)$ based on 12-periodic functions and triangular intervals.
Refined Identities: The Master Identity yields immediate consequences for the ordinary generating functions (setting $z=1$ ) and fixed-refinement generating functions (coefficients of $z^r$ ), establishing linear relations between the refined counts of the two partition families.
Quantum Modular Interpretation: The false theta series derived for $a''_2(n)$ is identified as a strong quantum modular form of weight $1/2$ . The paper connects this series to partial theta functions with periodic coefficients and describes its modular obstruction via an Eichler integral associated with a unary theta function.

Significance
The paper claims that the primary significance lies in proving the rigidity of the signed partition functions $a''_2(n)$ and $b''_2(n)$ , which was previously only observed computationally. The introduction of the bivariate variable $z$ reveals that these seemingly distinct conjectures are consequences of a single structural identity. The work provides a complete description of the coefficients, moving beyond the range assertion to exact formulas. Additionally, the paper highlights the connection between these partition identities and the theory of quantum modular forms, offering a concrete example of a false theta series arising from a combinatorial partition problem. The inclusion of both analytic and combinatorial proofs ensures the results are robust and provides insight into the underlying bijective structures.