arxiv: 2605.13096 · v1 · submitted 2026-05-13 · 🧮 math.CO

Recognition: unknown

Combinatorial construction of Russell's series for partition classes defined by Capparelli, Meurman, Primc, and Primc in the k=1 Case

Ka\u{g}an Kur\c{s}ung\"oz

Authors on Pith no claims yet

Pith reviewed 2026-05-14 18:42 UTC · model grok-4.3

classification 🧮 math.CO

keywords CMPP partitionscolored partitionsbivariate generating seriescombinatorial constructionbase partitionsallowed movespartition identitiesk=1 case

0 comments

The pith

Base partitions and allowed moves generate exactly Russell's bivariate series for CMPP partitions in the k=1 case.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper gives a combinatorial construction that realizes Russell's bivariate generating series as the enumeration of a specific class of colored partitions known as CMPP partitions when k equals 1. The construction begins with a small set of base partitions and applies a collection of allowed moves that transform them while preserving the relevant statistics. By showing that every reachable partition is a CMPP partition and that every CMPP partition arises this way exactly once, the series is proved to count the desired objects. The same framework also completes several cases left open in Russell's original symbolic computation.

Core claim

Russell's bivariate series for the k=1 CMPP partitions is realized combinatorially by taking certain explicit base partitions and closing them under a finite list of allowed moves; the resulting set coincides precisely with the CMPP partitions and is therefore counted by the series.

What carries the argument

Base partitions together with a finite set of allowed moves that generate all CMPP partitions without repetition.

If this is right

The bivariate series therefore has a direct bijective proof rather than a symbolic one.
Several previously missing cases in the k=1 family are now covered by the same construction.
The method supplies an explicit transformation rule that preserves the weight and the color statistics tracked by the series.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same base-and-moves approach may extend to other values of k once suitable bases are identified.
The construction could be used to prove further identities relating CMPP partitions to ordinary partition statistics.
It offers a concrete way to generate and enumerate the partitions by hand or algorithm, bypassing generating-function manipulation.

Load-bearing premise

The chosen base partitions and allowed moves produce every CMPP partition exactly once and no others.

What would settle it

Exhibit either a CMPP partition unreachable from the base partitions by the moves or a partition reachable by the moves that fails to be a CMPP partition.

Figures

Figures reproduced from arXiv: 2605.13096 by Ka\u{g}an Kur\c{s}ung\"oz.

**Figure 2.** Figure 2: After a folding operation on a designated part (i) There can be no parts whose relative heights become smaller after a folding operation. (ii) A folding operation conceals one and only one part. This is necessarily the part the relative height of which is declared h. Both of these claims can be shown with a visual aid [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 3.** Figure 3: Left end of a diagram have relative heights h or greater, remember that the relative height of n is assigned before all parts succeeding it, so the right leg of n cannot be used in determining the relative height of any part succeeding it. We now construct the base partitions. Proposition 12. For arbitrary but fixed i = 0, 1, 2, . . . , ℓ, set ki = 1 and the rest of the k·’s = 0. Choose and fix non-negativ… view at source ↗

**Figure 4.** Figure 4: The right leg is shorter than the right arm part absolute height relative height 1 (j − 1) 0 2 j 1 3 j 2 . . . (h + 1) (j − 1 + ⌈ h 2 ⌉) h . . . There are two possibilities that this streak breaks. Either the relative height and the absolute height become equal, as shown in [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗

**Figure 5.** Figure 5: The right arm is shorter than the right leg [PITH_FULL_IMAGE:figures/full_fig_p019_5.png] view at source ↗

**Figure 6.** Figure 6: The left end of a diagram when k0 = 1 part absolute height relative height 2j (2j − 1) (2j − 1) 2j + 2 2j 2j . . . 2(h − j + 1) h h . . . 2(ℓ − j) (ℓ − 1) (ℓ − 1) , and in the latter possibility as part absolute height relative height 2(ℓ − j) + 1 (ℓ − 1) 2(ℓ − j) 2(ℓ − j) + 3 (ℓ − 1) 2(ℓ − j) + 1 . . . 2(h − ℓ + j) + 1 (ℓ − 1) h . . . (2j − 1) (ℓ − 1) (ℓ − 1) . When k0 = 1 and the other kj ’s are zero, we… view at source ↗

**Figure 7.** Figure 7: Just placed the boxed n part absolute height relative height 2 0 0 4 1 1 6 2 2 . . . 2(h + 1) h h . . . 2ℓ (ℓ − 1) (ℓ − 1) . When a part n with relative height h is placed in a base partition, we encounter the portion of a diagram shown in [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗

read the original abstract

Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and \v{S}iki\'c, and by Trup\v{c}evi\'c. One main reason why CMPP partitions are significant is the authors' conjecture that the generating functions are infinite products in all cases. CMPP partitions are true extensions of the partition classes in the Rogers-Ramanujan-Gordon identities which are defined by difference conditions. As such, a natural question is to look for generating functions similar to the series side of Andrews-Gordon identities. Russell found such bivariate series for one case. He used symbolic computation in the proofs. We will combinatorially interpret Russell's bivariate series in a base partition and moves setting, and supply some missing cases, as well.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper turns Russell's symbolic series into an explicit base-and-moves construction for the k=1 CMPP partitions and fills in missing cases.

read the letter

The main takeaway is that this work replaces Russell's computer-derived bivariate series with a direct combinatorial model built from base partitions and a finite set of moves, while also covering some cases that were left out earlier. That is the concrete advance here. The construction aims to generate precisely the colored partitions satisfying the CMPP difference conditions for k=1, and the author checks that the moves preserve those conditions locally. Because the moves are finite and inspectable, the counting argument does not rest on an opaque global assumption. This is cleaner than pure symbolic manipulation and fits the long-running effort to find combinatorial proofs inside the Rogers-Ramanujan-Gordon family. The paper stays independent of the series itself, so there is no obvious circularity. The supplied missing cases are handled by the same method, which keeps the scope manageable. The limitation is clear: everything is restricted to k=1, and the text does not explore whether the base-and-moves idea extends to higher k or to the full CMPP conjecture. That keeps the result incremental rather than transformative. The verification steps are finite, so a referee can check them directly without needing new machinery. This is the kind of targeted note that specialists in partition identities will want to see, especially those already working on combinatorial interpretations of generating-function conjectures. It is not broad enough to interest a general audience, but it fills a specific gap left by the earlier symbolic work. I would send it to peer review. The claim is checkable, the contribution is real within its narrow lane, and the combinatorial framing is a step in the right direction even if the paper does not claim to solve the larger conjecture.

Referee Report

0 major / 3 minor

Summary. The paper constructs a base-partition-plus-moves model that combinatorially realizes Russell's bivariate generating series for the k=1 case of CMPP partitions and fills in several missing cases left open by prior work.

Significance. If the bijection holds, the work supplies an explicit, local-move combinatorial proof of the series side, replacing Russell's symbolic computation with a finite, checkable enumeration of moves that preserve the defining difference conditions. This strengthens the combinatorial understanding of CMPP partitions as extensions of Rogers-Ramanujan-Gordon classes and may facilitate further identities or generalizations.

minor comments (3)

[§2] §2: the definition of the allowed moves on the base partitions should include an explicit verification that each move preserves the CMPP difference conditions; a short table or lemma would make the preservation argument immediate.
[§4] §4: the enumeration of the 'missing cases' is stated to have been verified by the same method, but a brief summary of the additional base partitions or move sequences used for those cases would improve readability.
[Figure 1] Figure 1: the diagram of a sample base partition and its images under moves would benefit from clearer labeling of the difference conditions being preserved.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the accurate summary of our combinatorial construction, and the recommendation for minor revision. We respond to the points raised below.

read point-by-point responses

Referee: The paper constructs a base-partition-plus-moves model that combinatorially realizes Russell's bivariate generating series for the k=1 case of CMPP partitions and fills in several missing cases left open by prior work.

Authors: We appreciate the referee's summary. Our work defines an explicit base partition together with a finite set of local moves whose generating function matches Russell's bivariate series exactly. Each move is shown to preserve the difference conditions that define the CMPP partitions in the k=1 case, and we prove that every valid partition arises uniquely from the base partition by a sequence of these moves. This replaces the symbolic computation with a direct, checkable enumeration. The missing cases left open by earlier work are completed by extending the same base-and-moves framework to the remaining subcases. revision: no
Referee: If the bijection holds, the work supplies an explicit, local-move combinatorial proof of the series side, replacing Russell's symbolic computation with a finite, checkable enumeration of moves that preserve the defining difference conditions.

Authors: The bijection is established in the manuscript by exhibiting the inverse map: given any CMPP partition satisfying the k=1 difference conditions, we repeatedly apply the inverse moves until the base partition is recovered. Because the moves are local and the difference conditions are preserved in both directions, the correspondence is bijective. The enumeration is finite for each fixed size because only finitely many moves can be applied without violating the minimal-difference rules. revision: no

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper offers an explicit combinatorial construction of base partitions together with a finite set of local moves that is claimed to generate exactly the k=1 CMPP partitions counted by Russell's bivariate series. The argument proceeds by direct verification of the difference conditions under each move and by enumeration of the missing cases; neither step is defined in terms of the series itself nor relies on a self-citation whose content is presupposed. The central bijection claim therefore rests on an independent, inspectable enumeration rather than on any reduction to fitted parameters, self-definitional identities, or load-bearing prior results by the same authors. Consequently the derivation chain does not collapse to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no free parameters, axioms, or invented entities are visible in the provided text.

pith-pipeline@v0.9.0 · 5471 in / 1040 out tokens · 22274 ms · 2026-05-14T18:42:08.561544+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

22 extracted references · 3 canonical work pages · 2 internal anchors

[1]

An analytic proof of the Rogers-Ramanujan-Gordon identities.American Journal of Mathematics,88(4), pp.844–846

Andrews, G.E., 1966. An analytic proof of the Rogers-Ramanujan-Gordon identities.American Journal of Mathematics,88(4), pp.844–846

1966
[2]

An analytic generalization of the Rogers-Ramanujan identities for odd moduli

Andrews, G.E., 1974. An analytic generalization of the Rogers-Ramanujan identities for odd moduli. Proceedings of the National Academy of Sciences,71(10), pp.4082–4085

1974
[3]

A generalization of the Rogers-Ramanujan identities for all moduli.Journal of Combinatorial Theory, Series A,27(1), pp.64–68

Bressoud, D.M., 1979. A generalization of the Rogers-Ramanujan identities for all moduli.Journal of Combinatorial Theory, Series A,27(1), pp.64–68

1979
[4]

An analytic generalization of the Rogers-Ramanujan identities with interpretation

Bressoud, D.M., 1980. An analytic generalization of the Rogers-Ramanujan identities with interpretation. The Quarterly Journal of Mathematics,31(4), pp.385–399

1980
[5]

Andrews, G.E., 1998.The theory of partitions (No. 2). Cambridge university press

1998
[6]

and Primc, M., 2022

Capparelli, S., Meurman, A., Primc, A. and Primc, M., 2022. New partition identities fromC (1) ℓ -modules. Glasnik matematiˇ cki,57(2), pp.161–184

2022
[7]

and Konan, I., 2022

Dousse, J. and Konan, I., 2022. Characters of level 1 standard modules ofC (1) n as generating functions for generalised partitions. arXiv preprint arXiv:2212.12728

work page arXiv 2022
[8]

and Welsh, T.A., 2016

Foda, O. and Welsh, T.A., 2016. Cylindric partitions,⊒ r characters and the Andrews–Gordon–Bressoud identities.Journal of Physics A: Mathematical and Theoretical,49(16), p.164004

2016
[9]

and Rahman, M., 2011.Basic hypergeometric series (Vol

Gasper, G. and Rahman, M., 2011.Basic hypergeometric series (Vol. 96). Cambridge university press

2011
[10]

Gessel and C

Ira M. Gessel and C. Krattenthaler, Cylindric partitions,Trans. Amer. Math. Soc.,349(2):429–479, 1997

1997
[11]

A combinatorial generalization of the Rogers-Ramanujan identities.American Journal of Mathematics,83(2), pp.393–399

Gordon, B., 1961. A combinatorial generalization of the Rogers-Ramanujan identities.American Journal of Mathematics,83(2), pp.393–399

1961
[12]

Misra, and Carla D

Naihuan Jing, Kailash C. Misra, and Carla D. Savage, C.D. On multi-color partitions and the generalized Rogers–Ramanujan identities.Communications in Contemporary Mathematics,3(4), pp.533–548, 2001

2001
[13]

and Sills, A.V., 2017

Kanade, S., Lepowsky, J., Russell, M.C. and Sills, A.V., 2017. Ghost series and a motivated proof of the Andrews–Bressoud identities.Journal of Combinatorial Theory, Series A,146, pp.33–62

2017
[14]

Remarks on the conjectures of Capparelli, Meurman, Primc and Primc

Kanade, S., Russell, M.C., Tsuchioka, S. and Warnaar, S.O., 2024. Remarks on the conjectures of Cap- parelli, Meurman, Primc and Primc. arXiv preprint arXiv:2404.03851

work page internal anchor Pith review Pith/arXiv arXiv 2024
[15]

and¨Omr¨ uuzun Seyrek, H., 2025

Kur¸ sung¨ oz, K. and¨Omr¨ uuzun Seyrek, H., 2025. A decomposition of cylindric partitions and cylindric partitions into distinct parts.European Journal of Combinatorics,130, p.104219

2025
[16]

and Wilson, R.L., 1985

Lepowsky, J. and Wilson, R.L., 1985. The structure of standard modules: II. The caseA (1) 1 , principal gradation.Inventiones mathematicae,79(3), pp.417–442

1985
[17]

and ˇSiki´ c, T., 2016

Primc, M. and ˇSiki´ c, T., 2016. Combinatorial bases of basic modules for affine Lie algebrasC(1) n .Journal of mathematical physics,57(9)

2016
[18]

and ˇSiki´ c, T., 2019

Primc, M. and ˇSiki´ c, T., 2019. Leading terms of relations for standard modules of the affine Lie algebras C (1) n .The Ramanujan Journal,48(3), pp.509–543

2019
[19]

and Trupˇ cevi´ c, G., 2025

Primc, M. and Trupˇ cevi´ c, G., 2025. Linear independence forC(1) ℓ by usingC (1) 2ℓ .Journal of algebra,661, pp.341–356

2025
[20]

S.Ramanujan, L.J.Rogers, Proof of certain identities in combinatory analysis,Proc.Cambridge Phil.Soc.,19, 211–216 (1919)

1919
[21]

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

Russell, M.C., 2023. Companions to the Andrews-Gordon and Andrews-Bressoud identities, and recent conjectures of Capparelli, Meurman, Primc, and Primc. arXiv preprint arXiv:2306.16251. 31

work page internal anchor Pith review Pith/arXiv arXiv 2023
[22]

Bases of standard modules for affine Lie algebras of type.Communications in algebra, 46(8), pp.3663–3673

Trupˇ cevi´ c, G., 2018. Bases of standard modules for affine Lie algebras of type.Communications in algebra, 46(8), pp.3663–3673. Ka˘gan Kurs ¸ung¨oz, Faculty of Engineering and Natural Sciences, Sabancı University, Tuzla, Istanbul 34956, Turkey Email address:kursungoz@sabanciuniv.edu

2018