🔢 mathematics

Companions to the Andrews-Gordon and Andrews-Bressoud Identities and Recent Conjectures of Capparelli, Meurman, Primc, and Primc

This paper establishes bivariate generating functions and provides bijective proofs for the $k=1$ cases of recent colored partition conjectures by Capparelli, Meurman, and the Primcs, demonstrating their equivalence to identities by Jing, Misra, and Savage while relating them to the Andrews-Gordon and Andrews-Bressoud identities.

Original authors: Matthew C. Russell

Published 2026-05-14

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Matthew C. Russell

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 a master chef trying to organize a massive pantry. In the world of mathematics, this pantry is filled with integer partitions. A partition is simply a way of breaking a number down into a sum of smaller numbers. For example, the number 5 can be broken down as $3+2$ or $2+2+1$ or $5$.

This paper is about finding new, clever ways to count these "pantry arrangements" and proving that two completely different ways of counting actually lead to the exact same result. The author, Matthew Russell, is exploring a specific type of puzzle involving colored partitions and cylindric partitions.

Here is a breakdown of the paper's journey using simple analogies:

1. The Old Rules (The Classics)

For a long time, mathematicians had famous rules for counting these partitions, known as the Andrews-Gordon and Andrews-Bressoud identities. Think of these as the "classic recipes" for organizing the pantry. They tell you exactly how many ways you can arrange your ingredients if you follow certain strict rules (like "you can't have two large ingredients next to each other").

2. The New Challenge (The CMPP Conjectures)

Recently, a group of mathematicians (Capparelli, Meurman, and the Primcs) proposed some new, slightly different rules. They imagined a pantry where every ingredient has a color (like red apples, green apples, blue apples). They also arranged these ingredients in a special grid with many rows.

Their rules were tricky:

You have a "downward path" (like a sliding chute) going through the grid.
The rule is that the total "weight" of ingredients sliding down any single chute cannot exceed a certain limit.
They made a guess (a conjecture) about how many ways you could fill this pantry under these rules.

3. The Author's Discovery (The "k=1" Case)

Matthew Russell decided to test these new rules, but he started with a simplified version: he set the limit to 1. This means that on any single sliding chute, you can only have one ingredient (or none at all).

He found two major things:

The Formula Match: He proved that the number of ways to arrange the pantry under these new "colored" rules is exactly the same as the number of ways to arrange it under the old "classic" rules. He did this by writing down a complex mathematical formula (a "generating function") for both sides and showing they are identical twins.
The Hidden Connection: He realized that this specific "limit of 1" case had actually been solved before by three other mathematicians (Jing, Misra, and Savage) in 2001, but they used different language. Russell's paper connects the dots, showing that the new "colored" rules are just a different way of looking at the old "difference" rules.

4. The Magic Trick (Bijections and Cylinders)

The most visual part of the paper is the bijection. In math, a bijection is a perfect one-to-one match, like pairing every left shoe with a right shoe.

Russell created a magic trick to match two very different objects:

Cylindric Partitions: Imagine taking two rows of numbers and wrapping them around a cylinder. The numbers must stay in order as they wrap around.
Colored Partitions: The specific "colored" pantry arrangements described above.

He showed that for every single way you can wrap the numbers around the cylinder, there is exactly one way to arrange the colored pantry, and vice versa. He didn't just say they are equal; he built a machine (a set of rules) that transforms one into the other without losing or creating anything.

5. The "Flipping" Trick

To prove his formulas were correct, Russell used a technique he calls "flipping." Imagine looking at a reflection of your pantry in a mirror. Sometimes, if you flip the arrangement upside down or swap the rows, the rules change slightly, but the total count remains the same. By using these flips, he could turn a complicated problem into a simpler one, proving that his formulas held true.

Summary

In short, this paper is a detective story in the world of numbers.

The Mystery: Do these new, complex "colored" rules for organizing numbers match the old, famous rules?
The Clue: When you restrict the rules to a simple "one item per chute" scenario, the answer is yes.
The Proof: The author built a bridge (a bijection) between these colored arrangements and "cylindrical" arrangements, proving they are two sides of the same coin.

The paper doesn't claim to solve real-world engineering problems or medical issues. Instead, it solves a beautiful, abstract puzzle about how numbers can be grouped and counted, adding a new chapter to the history of mathematical patterns.

Technical Summary: Companions to the Andrews–Gordon and Andrews–Bressoud Identities and Recent Conjectures of Capparelli, Meurman, Primc, and Primc

Problem Statement
This paper addresses the combinatorial and analytic structure of recently conjectured colored partition identities proposed by Capparelli, Meurman, A. Primc, and M. Primc (CMPP). These conjectures relate to standard representations of the affine Lie algebra of type $C^{(1)}_\ell$ ( $\ell \ge 2$ ). Specifically, the paper focuses on the $k=1$ case of these conjectures, where $k$ represents the sum of initial conditions $k_0 + \dots + k_\ell$ . The authors aim to derive bivariate generating functions for these specific cases, relate them to the classical Andrews–Gordon and Andrews–Bressoud identities, and provide bijective proofs connecting these colored partitions to two-rowed cylindric partitions.

Methodology
The paper employs a combination of analytic and combinatorial techniques:

Frequency Arrays and Downward Paths: The authors define "colored partitions" using extended frequency arrays with $2\ell$ rows (for the Andrews–Gordon case) or $2\ell-1$ rows (for the Andrews–Bressoud case). Admissibility is defined via "downward paths" in these arrays, where the sum of frequencies along any path must not exceed the total initial condition $k$ .
Functional Equations: By analyzing the structure of admissible partitions and utilizing a "flipping" trick (reversing the array to map partitions to shifted versions of themselves), the authors derive systems of functional equations for the bivariate generating functions $P_i(z, q)$ and $P^\star_i(z, q)$ .
Atomic Relations: To prove that the proposed multisum formulas satisfy these functional equations, the authors introduce a method of "atomic relations." This involves defining linear combinations of series terms (denoted $S_v$ ) that vanish identically. By expressing the functional equations as linear combinations of these atomic relations, the authors verify the validity of the multisum identities without relying on computer algebra for general $\ell$ .
Bijections: The final section constructs explicit bijections between two-rowed cylindric partitions of a specific profile and pairs consisting of an ordinary partition and a colored admissible partition. This follows the spirit of Corteel's work on cylindric partitions.

Key Contributions and Results

Bivariate Generating Functions (Theorems 1.5 and 1.6):
The primary result is the derivation of bivariate generating functions for the $k=1$ cases of the CMPP conjectures.
- For the $2\ell$ -row case (Andrews–Gordon type), the generating function $P_i(z, q)$ is shown to equal a specific multisum involving $z^{N_1} q^{\sum N_j^2 + \dots}$ .
- For the $2\ell-1$ -row case (Andrews–Bressoud type), a similar multisum is derived for $P^\star_i(z, q)$ .
- Crucially, the authors note that while the $k=1$ sum-to-product identities (setting $z=1$ ) were previously established by Jing, Misra, and Savage (2001) in a different notation, the bivariate multisums presented in Theorems 1.5 and 1.6 are new.
Connection to Cylindric Partitions:
The paper demonstrates that the generating functions $P_i(z, q)$ and $P^\star_i(z, q)$ , when divided by $(zq; q)_\infty$ , coincide with the bivariate generating functions for two-rowed cylindric partitions found by Warnaar. This links the CMPP conjectures directly to the geometry of cylindric partitions.
Bijective Proof (Theorem 6.2):
The authors provide a bijection between:
1. Cylindric partitions of profile $(2\ell+1, 0)$ .
2. Pairs $(\mu, \nu)$ , where $\mu$ is an ordinary partition and $\nu$ is a $[1, 0, \dots, 0]$ -admissible colored partition on $2\ell$ rows.
  This bijection generalizes Corteel's work on the Rogers–Ramanujan identities.
Resolution of Specific Conjecture Cases:
The paper confirms the $k=1$ cases for both the "odd-odd" and "even-even" frequency array configurations proposed by CMPP. While Dousse and Konan had previously proved the odd-odd case using perfect crystals, this paper provides a distinct proof method that simultaneously handles both cases and establishes the bivariate refinement.

Significance and Claims
The paper claims significance in three main areas:

Unification: It unifies the CMPP conjectures with the classical Andrews–Gordon and Andrews–Bressoud identities by showing that the $k=1$ cases are essentially variants of these classical identities, differing only in the bivariate refinement (replacing $x^{N_1+\dots+N_\ell}$ with $z^{N_1}$ ).
Novelty of Bivariate Forms: While the univariate product identities were known (via Jing, Misra, and Savage), the paper asserts that the bivariate multisum forms are new contributions.
Combinatorial Insight: By providing explicit bijections to cylindric partitions, the paper offers a concrete combinatorial interpretation for these colored partition identities, moving beyond purely algebraic or representation-theoretic proofs.

The authors explicitly state that they do not claim to have initially discovered the $k=1$ product identities, acknowledging the prior work of Jing, Misra, and Savage. Instead, their contribution lies in the bivariate refinement, the functional equation derivation, and the bijective connection to cylindric partitions. The paper concludes by suggesting future research directions, such as extending these methods to $k > 1$ cases and exploring similar refinements for other families of partition identities like the Göllnitz–Gordon–Andrews identities.