REVIEW 4 major objections 5 minor 41 references
The combinatorics of identities involving overpartitions with distinct parts
T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read The paper proves two-variable refinements of the Andrews–El Bachraoui overpartition identities, with the new variable tracking the number of parts beyond the smallest overlined part, and constructs bijections that explain the resulting…
desk verdict Correct q-series refinements, but the bijective section needs complete case checks before acceptance. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The analytic engine is the q-Gauss summation formula (2.1), applied with the substitutions $(q,a,b,c)\to(q^2,q^2,-xq,-xq^4)$ and $(q,a,b,c)\to(q^2,q^2,-xq^2,-xq^5)$; these substitutions turn the refined series into the product forms $\frac{q}{1-q}(-xq^2;q^2)_\infty$ and $\frac{q}{1-q}(-xq^3;q^2)_\infty$. The combinatorial engine is the map $\varphi$ of Lemma 2.1 and its analogue $\psi$ of Lemma 2.4, which lower the smallest overlined part by one while either preserving the number of extra parts or converting the overpartition into a partition counted by $\mathrm{ped}$ or $\mathrm{pod}_{>1}$. In Section 3 the key object is the decomposition of an overpartition with distinct parts into pairs of type I, pairs of type II, singletons of type I, and singletons of type II; the bijections $f_0,f_1,h_0,h_1$ are defined by splitting non-overlined parts into pairs and merging pairs back, with the largest singleton of the relevant type serving as a pivot.
What would settle it
Enumerate all overpartitions of $n$ with distinct parts for $n\le 20$ and compare the coefficients of $\sum A(n,m)x^m q^n$ with the product $\frac{q}{1-q}(-xq^2;q^2)_\infty$; a single mismatch refutes Theorem 1.9. Similarly, compute the maps $\varphi$ and $\psi$ on all overpartitions of $n\le 15$ and check that every image is well-defined, has the prescribed weight and part count, and that the stated inverse recovers the original object.
Extended reading notes
Core claim
The paper's central claim is that the sequences $A(n,m)$ and $B(n,m)$, counting overpartitions of $n$ into distinct parts with a distinguished smallest overlined part and exactly $m$ other parts, satisfy $$\sum_{m\ge0,n\ge1} A(n,m)x^m q^n = \frac{q}{1-q}(-$xq^{2}$;$q^{2}$)_\infty, \qquad \sum_{m\ge0,n\ge1} B(n,m)x^m q^n = \frac{q}{1-q}(-$xq^{3}$;$q^{2}$)_\infty.$$ These refine Theorems 1.1 and 1.3 and imply the difference identities $A(n,m)-A(n-1,m)=\mathrm{ped}(n-1,m)$ and $B(n,m)-B(n-1,m)=\mathrm{pod}_{>1}(n-1,m)$. The paper then constructs bijections $\varphi$ and $\psi$ that realize these difference identities directly on overpartitions, and constructs further bijections $f_0,f_1,h_0,h_1$ from a decomposition into pairs and singletons of types I and II, proving the parity refinements in Theorems 1.13 and 1.14. On the paper's own terms, the discovery is that the Andrews–El Bachraoui identities have a uniform combinatorial cause, located in how the smallest overlined part and its neighboring parts can be shifted, split, or paired.
Load-bearing premise
The argument depends on the unstated assumption that the bijections in Section 3 cover every overpartition exactly once, with no case left unchecked and no object counted twice, even though some parts can fit both classification types.
Editorial extensions
If this is right
- Theorem 1.9 gives an exact product formula for $A(n,m)$, so the two-parameter family can be read off from the coefficients of $\frac{q}{1-q}(-xq^2;q^2)_\infty$ without enumerating overpartitions.
- Theorem 1.10, via the bijection $\varphi$, makes $A(n,m)-A(n-1,m)$ literally the number of partitions of $n-1$ into distinct even parts with $m$ parts; summing over $m$ recovers Corollary 1.2(a).
- Theorem 1.12 and the bijection $\psi$ recover Corollary 1.4(b), and Remark 2.6 shows how $B(n)-B(n-2)=\mathrm{pod}(n-1)$ follows from the refined statement.
- Theorems 1.13 and 1.14 reduce Corollaries 1.6 and 1.8 to the pair/singleton bijections plus arithmetic of the even/odd overpartition counts.
- The type-I/type-II pair-singleton decomposition is a reusable structural description of overpartitions with distinct parts, not merely a proof device for these four identities.
Reading between the lines
- One could test whether the $x$ variable has a natural statistic interpretation in other overpartition identities by specializing $x=-1$ or $x=q^r$ in the refined generating functions and seeing which signed or weighted companions emerge.
- The pair-singleton decomposition suggests a general method: any overpartition identity that uses the greatest or smallest overlined part as a pivot may admit a refinement by the number of singletons or pairs, yielding new multivariate identities.
- Because Lemma 2.4 is explicitly sketched rather than fully proved, an independent computer check of $\psi$ on all overpartitions up to $n=15$ would either supply the missing confidence or expose a case needing a different rule.
- The definitions of singleton and pair of types I and II overlap (a part can belong to both a type-II pair and a type-I singleton), so making the Section 3 bijections fully rigorous would require either a total order on the four classes or a direct disjointness proof for the ranges used.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper refines four identities of Andrews and El Bachraoui concerning overpartitions with distinct parts. Theorems 1.9 and 1.11 give bivariate refinements, tracking the number of parts other than the smallest overlined part, of the generating functions for A(n) and B(n); Theorems 1.10 and 1.12 convert these into difference identities with partition counting functions. Section 2 provides analytic proofs via the q-Gauss summation and then a bijective proof of Theorem 1.10 via the map φ in Lemma 2.1, while Lemma 2.4 states an analogous bijection ψ for Theorem 1.12 with details omitted. Section 3 introduces a type I/type II pair–singleton decomposition of overpartitions and uses it to claim bijective proofs of Theorems 1.13 and 1.14, which imply Corollaries 1.6 and 1.8. The analytic parts are clean, but the bijective constructions in Section 3 and the compressed proof of Lemma 2.4 contain gaps that need to be addressed.
Significance. The paper's analytic refinements are genuine and check out: the derivations of Theorems 1.9 and 1.11 from the q-Gauss summation are parameter-free and explicitly exhibited, and the generating-function manipulations in the proofs of Theorems 1.10 and 1.12 are correct. If the bijective constructions in Section 3 are completed and verified, the paper would provide a useful structural explanation of Corollaries 1.6 and 1.8, and the parity-refined Theorems 1.13 and 1.14 would be new results of independent interest. The manuscript also includes worked examples that illustrate the intended bijections. The main deficits are technical: the pair–singleton decomposition is not proved well-defined in overlapping situations, and several bijections are asserted with 'easy check' or omitted details rather than verified.
major comments (4)
- [Section 3, Definition 3.2] The type I/type II pair and singleton decomposition is not well-defined on arbitrary overpartitions because the defining conditions overlap. For example, in the overpartition 5, \bar{4}, 4, \bar{3}, the part \bar{4} is simultaneously the second element of a type II pair (5,\bar{4}) and the first element of a type I pair (\bar{4},4). The manuscript gives no rule for resolving such overlapping adjacencies, yet the subsequent bijections f0, f1, h0, and h1 are defined by operating on 'the' largest singleton of type I or type II. Without a canonical, well-defined decomposition, these maps are ambiguous and the cardinality identities in Theorems 1.13 and 1.14 do not follow.
- [Theorem 1.13, Part I] The assertion that 'the largest singleton of type I must appear' for any overpartition with an odd number of parts is not proved, and it depends on the unestablished well-definedness of the pair–singleton decomposition. Additionally, the map described as 'changing each overlined (resp. non-overlined) singleton of type I to a non-overlined (resp. an overlined) one' requires a case check that flipping singletons preserves the distinctness conditions of an overpartition, especially when a part is adjacent to another part that could be affected by the flips. This case check is absent, so the proof of the bijection f0 is incomplete.
- [Lemma 2.4] The proof of Lemma 2.4 is exactly one sentence: 'The proof is similar to Lemma 2.1, so we will omit some details here and only provide the specific operations.' This is insufficient for a load-bearing step, because the B-type conditions involve different parity and size inequalities than the A-type conditions, and the inverse map is not verified. In particular, the operations in CASE III and CASE III' have not been shown to preserve the conditions 'remaining overlined parts are odd and > 2sp(π)+1' and 'non-overlined parts are even and < 2sp(π)', nor has the weight and length correspondence been checked. Since Lemma 2.4 is the basis of Theorem 1.12, these omissions must be filled explicitly.
- [Theorem 1.14 and Example 3.4] The maps h0 and h1 are described only by 'the same ways' as h0, with the inverse and parity/weight checks left to an 'easy check'. More concretely, Example 3.4 contains numerical inconsistencies that indicate the constructions are not yet correct as stated: the overpartition π1 = 23+15+13+5+5+2+1 has weight 64, not 59, and its image λ1 = 12+11+8+7+7+6+5+5+2+1 has weight 64, not 57; similarly, π2 = 17+15+6+6+2 has weight 46, while its displayed image λ2 = 9+8+8+7+7+6+2 has weight 47, although h1 should preserve total weight for π∈D1(n). These discrepancies must be resolved before the bijective proofs can be accepted.
minor comments (5)
- [Abstract and throughout] The name 'El Bachraoui' is consistently typeset as 'EI Bachraoui' in the abstract and several headings; correct the spelling.
- [Section 2, Lemma 2.1, CASE II] The phrase 'easily check' in CASE II of the proof of Lemma 2.1 is acceptable only because the surrounding text supplies the needed inequalities; however, a one-sentence justification of why the non-overlined parts remain odd and below 2sp(λ) would improve readability.
- [Section 3, Definition 3.2 example] In the example λ = 12+12+11+11+9+8+8+7+6+3+3, the word 'λ is non-overlined' appears in item (iv) where it should read 'λ_k is non-overlined'; this is a typographical issue but worth correcting.
- [Section 3, proof of Theorem 1.13, Part II] The set notation 'P_e_d(pn) - P_d1(pn)' is written as '|P_e_d(pn) - P_d1(pn)|' in a way that is not formally correct; the difference of sets should be defined using set difference, and the cardinality taken afterward.
- [Remark 3.5] The derivation of Corollary 1.6 uses the identity p_d(n) = p_nop(n) from Proposition 3.1; this is correct, but the step 'p_d(n) - p_ed(n) = p_od(n)' would be clearer if the parity decomposition p_d(n) = p_ed(n)+p_od(n) were stated explicitly.
Circularity Check
No circularity: new refinements are derived from the external q-Gauss summation theorem and explicit bijections, with no fitted input renamed as prediction.
full rationale
The derivation chain is self-contained against standard external results rather than against the paper's own conclusions. Theorems 1.9 and 1.11 are proved by substituting parameter choices into the classical q-Gauss summation formula, equation (2.1), to obtain equations (2.2) and (2.3); the displayed generating functions are then algebraic consequences, not restatements of the claimed equalities. Theorems 1.10 and 1.12 are obtained by subtracting the generating functions and comparing with the known generating functions for partitions into even distinct parts and odd distinct parts greater than 1, respectively; no fitted parameter is renamed as a prediction. Lemmas 2.1 and 2.4 construct bijections by explicit case-by-case maps with inverse descriptions, and the cardinality identities follow from the maps as stated. Section 3 introduces the singleton/pair decomposition and constructs the maps f0, f1, h0, and h1 directly; the claimed set equalities are argued from the maps and from elementary parity or merging/splitting arguments. The only cited input results are the Andrews-El Bachraoui identities being refined, which are external and not the author's own prior work, so no self-citation is load-bearing. The omissions and abbreviated checks in the bijective proofs concern rigor and correctness, not circularity, since the target equalities are not assumed as inputs anywhere.
Assumptions & free parameters
assumptions (3)
- standard math q-Gauss summation theorem, equation (2.1), cited to Gasper and Rahman
- domain assumption Convention that an overpartition into distinct parts allows one overlined and one non-overlined copy of the same integer, while non-overlined parts must be distinct
- standard math Euler's partition theorem, distinct parts are equinumerous with odd parts
Cite this review
Pith. "Pith review of The combinatorics of identities involving overpartitions with distinct parts." pith.science (2026). https://pith.science/paper/WRYCP6RY
@misc{pith2026250606640,
author = {Pith},
title = {Pith review of: The combinatorics of identities involving overpartitions with distinct parts},
year = {2026},
howpublished = {\url{https://pith.science/paper/WRYCP6RY}},
note = {Machine review of arXiv:2506.06640}
}
abstract
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results by the number of parts of partitions and furthermore, we will also provide the combinatorial proofs for those partition identities.
Reference graph
Works this paper leans on
-
[1]
Alladi, A multi-dimensional extension of Sylvester's identity, Int
K. Alladi, A multi-dimensional extension of Sylvester's identity, Int. J. Number Theory 13 (2017), 2487--2504
work page 2017
-
[2]
K. Alladi and A. Berkovich, New polynomial analogues of Jacobi's triple product and Lebesgue's identities, Adv. in Appl. Math. 32 (2004), 801--824
work page 2004
-
[3]
K. Alladi and B. Gordon, Partition identities and a continued fraction of Ramanujan, J. Combin. Theory Ser. A 63 (1993), 275--300
work page 1993
-
[4]
G. E. Andrews, Two theorems of Gauss and allied identities proved arithmetically, Pacific J. Math. 41 (1972), 563--578
work page 1972
-
[5]
G. E. Andrews, Partitions and Durfee dissection, Amer. J. Math. 101 (1979), 735--742
work page 1979
-
[6]
G. E. Andrews, The Theory of Partitions , Cambridge University Press, Cambridge (1998)
work page 1998
-
[7]
G. E. Andrews and M. E. Bachraoui, Companions for well-known formulas and applications to overpartitions. Ramanujan J. 67 (2025), 62
work page 2025
-
[8]
D. Chen and S. Yin, Rogers-Ramanujan type identities involving double sums, SIGMA. Symmetry, Integrability and Geometry: Methods and Applications 20 (2024), Paper No. 103, 6
work page 2024
Show all 41 references
-
[9]
Corteel and J
S. Corteel and J. Lovejoy, Overpartitions, Trans. Am. Math. Soc. 356 (2004), 1623-1635
2004
-
[10]
G. E. Andrews, Rogers-Ramanujan identities for two-color partitions, Indian J. Math. 29 (1987), 117--125
1987
-
[11]
G. E. Andrews, Basis partition polynomials, overpartitions and the Rogers-Ramanujan identities, J. Approx. Theory 197 (2015), 62--68
2015
-
[12]
G. E. Andrews, Partition identities for two-color partitions, Hardy-Ramanujan Journal 44 (2021), 74--80
2021
-
[13]
G. E. Andrews, S. Bhattacharjee, and M. G. Dastidar, Sequences in partitions, Integers 22 (2022), Paper No. A32, 9 pp
2022
-
[14]
G. E. Andrews, S. Chern and Z. Li, On the k -measure of partitions and distinct partitions, Algebr. Comb. 5 (2022), 1353--1361
2022
-
[15]
Berkovich and A
A. Berkovich and A. K. Uncu, Elementary polynomial identities involving q -trinomial coefficients, Ann. Comb. 23 (3-4) (2019), 549--560
2019
-
[16]
Bessenrodt, A bijection for Lebesgue's partition identity in the spirit of Sylvester, Discrete Math
C. Bessenrodt, A bijection for Lebesgue's partition identity in the spirit of Sylvester, Discrete Math. 132 (1994), 1--10
1994
-
[17]
W. Y. C. Chen, Q.-H. Hou, and L. H. Sun, An iterated map for the Lebesgue identity , arXiv:1002.0135v2 https://arxiv.org/abs/1002.0135
-
[18]
Chern, S
S. Chern, S. Fu, and D. Tang, Multi-dimensional q -summations and multi-colored partitions, Ramanujan J. 51 (2020), 297--306
2020
-
[19]
Corteel and J
S. Corteel and J. Lovejoy, Overpartitions, Trans. Amer. Math. Soc. 356 (2004), 1623--1635
2004
-
[20]
Dousse and B
J. Dousse and B. Kim, An overpartition analogue of q -binomial coefficients, II: Combinatorial proofs and (q,t) -log concavity, J. Combin. Theory Ser. A 158 (2018), 228--253
2018
-
[21]
Fu and H
S. Fu and H. Li, Sequences of odd length in strict partitions I: the combinatorics of double sum Rogers-Ramanujan type identities, preprint
-
[22]
Fu and H
S. Fu and H. Li, Sequences of odd length in strict partitions II: the 2 -measure and refinements of Euler's theorem, preprint
-
[23]
Fu and H
S. Fu and H. Li, Sequences of odd length in strict partitions II: Rogers-Ramanujan partitions and multi-sum identities, preprint
-
[24]
Fu and D
S. Fu and D. Tang, Partitions with fixed largest hook length, Ramanujan J. 45 (2018), 375--390
2018
-
[25]
Gasper and M
G. Gasper and M. Rahman, Basic hypergeometric series , Encyclopedia of Mathematics and its applications 35, Cambridge University Press, Cambridge, 1990
1990
-
[26]
L. Hao, X. Yue and L. Xia, Generalizations of Rogers-Ramanujan type identities, Ramanujan J. 65 (2024), 797--819
2024
-
[27]
Kur s ung\" o z, Parity considerations in Andrews-Gordon identities, European J
K. Kur s ung\" o z, Parity considerations in Andrews-Gordon identities, European J. Combin. 31 (2010), 976--1000
2010
-
[28]
Li and L
Z. Li and L. Wang, Rogers-Ramanujan type identities involving double, triple and quadruple sums, Ramanujan J. 65 (2024), 333--390
2024
-
[29]
P. A. MacMahon, Combinatory Analysis , Cambridge University Press, London (1915/16)
1915
-
[30]
Gupta, The rank-vector of a partition, Fibonacci Quart
H. Gupta, The rank-vector of a partition, Fibonacci Quart. 16 (1978), 548--552
1978
-
[31]
W. J. Keith and R. Nath, Partitions with prescribed hooksets, J. Comb. Number Theory 3 (1) (2011), 39--50
2011
-
[32]
Lovejoy and R
J. Lovejoy and R. Osburn, M_2 -rank differences for partitions without repeated odd parts, J. Th\'eor. Nombres Bordeaux 21 (2009): 313--334
2009
-
[33]
P. A. MacMahon, The theory of modular partitions, Proc. Cambridge Phil. Soc. 21 (1923), 197--204
1923
-
[34]
Pak, Partition bijections, a survey, Ramanujan J
I. Pak, Partition bijections, a survey, Ramanujan J. 12 (2006), 5--75
2006
-
[35]
Rogers, Second memoir on the expansion of certain infinite products, Proc
L.J. Rogers, Second memoir on the expansion of certain infinite products, Proc. Lond. Math. Soc. 25 (1894), 318--343
-
[36]
Wang and W
L. Wang and W. Zeng, Rogers-Ramanujan type identities for rank two partial Nahm sums , arXiv:2502.19309 https://arxiv.org/abs/2502.19309
-
[37]
C. Wei, Y. Yu and G. Ruan, Multidimensional Rogers-Ramanujan type identities with parameters , arXiv:2302.00357v3 https://arxiv.org/abs/2302.00357v3
-
[38]
A. K. Uncu, On double sum generating functions in connection with some classical partition theorems, Discrete Math. 344 (2021) 112562
2021
-
[39]
R. P. Stanley, Enumerative Combinatorics, vol. I, 2nd edition , Cambridge Studies in Advanced Mathematics, Cambridge University Press, (2011)
2011
-
[40]
S. O. Warnaar, The Andrews-Gordon identities and q -multinomial coefficients, Comm. Math. Phys. 184 (1997), 203--232
1997
-
[41]
Zeng, The q -variations of Sylvester's bijection between odd and strict partitions, Ramanujan J
J. Zeng, The q -variations of Sylvester's bijection between odd and strict partitions, Ramanujan J. 9 (2005), 289--303
2005
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.