REVIEW 1 major objections 6 minor 8 references
Some Comments on Regular Overpartitions modulo $2^k$
T0 review · 1 major / 6 minor · reviewed 2026-07-09 · glm-5.2
Pith's one-line read Regular overpartition counts modulo 2^k reduce to counting ordinary partitions with few part sizes
desk verdict Correct but thin: the main observation is immediate, and concrete results reproduce prior work. 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 decomposition R(n) = sum_{r>=1} 2^r N_r(n), where N_r(n) counts restricted ordinary partitions with exactly r distinct part sizes. Truncating this sum at r=k-1 gives the residue modulo 2^k. The r=1 term is evaluated via divisor-counting functions, and the r=2 term involves restricted solutions to au+bv=n.
What would settle it
A single partition with k distinct part sizes whose contribution 2^r is not divisible by 2^k would break the truncation. This cannot happen because each distinct part size contributes an independent factor of 2, so 2^r is always divisible by 2^k when r >= k. The identity is therefore robust. The real question is whether the surviving terms N_r for r < k can be evaluated in closed form, which the paper achieves for r=1 but leaves open for r >= 2.
Extended reading notes
Core claim
The central result is Theorem 1, which states that for every k at least 1, the ell-regular overpartition count modulo 2^k equals the truncated sum of 2^r times the number of restricted ordinary partitions with exactly r distinct part sizes, summed from r=1 to k-1, with an identical statement for the biregular case. The key observation is that overlining the first occurrence of each distinct part size is an independent binary choice, so the factor 2^r attached to partitions with r distinct part sizes means that modulo 2^k, all contributions from partitions with k or more distinct part sizes vanish. The r=1 term reduces to a divisor count, yielding the modulo-4 characterizations: the overcount
Load-bearing premise
The paper's framing as a substantial generalization rests on the premise that extending a known decomposition from unrestricted to restricted overpartitions and to all powers of 2 yields meaningful new information. The structural identity is correct, but the modulo-4 results reproduce prior work, and the modulo-8 expressions leave the two-distinct-part-size term unevaluated, so the framework does not yet deliver complete characterizations beyond what was known.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the functions $R_ell(n)$ and $R_{ell,mu}(n)$, counting $ell$-regular and $(ell,mu)$-regular overpartitions of $n$, respectively. The central result (Theorem 1) is that for any $k geq 1$, these functions modulo $2^k$ depend only on ordinary partitions in the restricted class having fewer than $k$ distinct part sizes, via the identity $R(n) = sum_{r geq 1} 2^r N_r(n)$ truncated modulo $2^k$. The authors provide explicit formulas for the $r=1$ and $r=2$ terms (divisor counts and weighted sums of $S_{a,b}(n)$), deduce modulo-4 characterizations in terms of perfect squares (Corollaries 1-2), and state modulo-8 expressions (Theorem 2). The framework generalizes Kim's decomposition of the unrestricted overpartition function modulo 8.
Significance. The mathematics is correct and self-contained. Lemma 1 is a clean, parameter-free combinatorial observation: each ordinary partition with $r$ distinct part sizes lifts to exactly $2^r$ overpartitions, and truncation modulo $2^k$ is immediate since $2^r equiv 0 pmod{2^k}$ for $r geq k$. The explicit evaluations of $N_1$ (divisor counts via inclusion-exclusion, Lemma 2) and $N_2$ (sums of $S_{a,b}(n)$ with regularity indicators) are standard and verifiable. The modulo-4 corollaries correctly apply the classical fact that $tau(m)$ is odd iff $m$ is a perfect square. The paper is honest about its limitations: the concluding remarks (items 1-3) explicitly acknowledge that $N_2^{(ell)}(n)$ and $N_3^{(ell)}(n)$ remain unevaluated, which would be needed for complete characterizations modulo 8 and 16.
major comments (1)
- The introduction (Section 1) frames Theorem 1 as a 'substantial generalization' of Kim's decomposition, but the gap between framing and deliverable is notable. Lemma 1 is a one-line observation, the modulo-4 corollaries (Corollaries 1-2) are explicitly noted as reproducing prior results from [3, Corollary 2] and [1, Theorem 3.4], and the modulo-8 expressions (Theorem 2) leave the key term $N_2^{(ell)}(n)$ unevaluated. Thus the framework does not yet produce a complete characterization modulo 8 that would constitute a genuine advance over Kim's unrestricted result. The authors should either tone down the 'substantial generalization' language or, preferably, provide at least one new complete characterization (e.g., for a specific $ell$) that demonstrates the framework's power beyond reproducing known results. This is a framing/substance issue, not a correctness issue.
minor comments (6)
- Abstract: the expression '$overline{R}_{ell (n)$' has a missing closing brace and should read '$overline{R}_{ell}(n)$'.
- Section 2, Lemma 2: the proof is omitted ('not difficult to prove, so we omit the details'). While the result is standard inclusion-exclusion, a one-line proof would improve self-containedness.
- Section 3, Theorem 1: the notation $N_3$ in the statement 'and similarly $N_3 = sum_{a>b>c} epsilon(a,b,c) T_{a,b,c}(n)$' should specify the superscript, i.e., $N_3^{(ell)}$ or $N_3^{(ell,mu)}$, for consistency with the rest of the theorem.
- Section 3, proof of Theorem 1: the phrase 'A partition with $r = 1$ has the form $(dn/d)$ with $d|n$' is slightly unclear; writing the part as '$n/d$' (occurring $d$ times) or simply 'the single part size is $n/d$ for some divisor $d$ of $n$' would be clearer.
- The paper would benefit from at least one numerical example showing the truncation in action for small $n$ and specific $ell, mu$, illustrating how the $N_r$ terms combine to give $R_ell(n) pmod{8}$ or $pmod{16}$.
- Reference [1] is cited as 'AIMS Math. 11 (2026), no. 4, 9876-9891'; the year 2026 is unusual and may need verification.
Circularity Check
No circularity: the central result follows from the definition of overpartitions and binary truncation, with no fitted parameters or self-citation chains.
full rationale
The paper's central result (Lemma 1 / Theorem 1) is self-contained and non-circular. The derivation chain is: (1) an ordinary partition with r distinct part sizes lifts to exactly 2^r overpartitions by independent binary choice per distinct part size (definition of overpartitions from Corteel-Lovejoy [5]); (2) overlining does not change part-size membership in the restricted class, so the class restriction applies identically to the underlying ordinary partition; (3) summing over all r gives R(n) = sum 2^r N_r(n); (4) reducing modulo 2^k truncates the sum at r = k-1 since 2^r ≡ 0 (mod 2^k) for r ≥ k. No step reduces to its own inputs by construction. The explicit formulas for N_1 (divisor counts via inclusion-exclusion, Lemma 2) and N_2 (sums of S_{a,b}(n) weighted by regularity indicators) are standard combinatorial identities verifiable independently. The modulo-4 corollaries use the classical fact that τ(m) is odd iff m is a perfect square — an external arithmetic fact, not a self-citation. The paper does cite prior work by the same authors [1, 2, 3], but only to acknowledge that the modulo-4 results were previously obtained in different but equivalent forms (explicitly noted after Corollaries 1-2). These citations are acknowledgments of priority, not load-bearing premises. The framework's limitation — that N_2^{(ℓ)}(n) remains unevaluated, preventing a complete modulo-8 characterization — is honestly stated in the concluding remarks and does not constitute circularity.
Assumptions & free parameters
assumptions (3)
- standard math An ordinary partition with r distinct part sizes lifts to exactly 2^r overpartitions by independent binary choice per distinct part size.
- standard math τ(m) is odd if and only if m is a perfect square.
- domain assumption The class of ℓ-regular (or (ℓ,μ)-regular) partitions is defined solely by conditions on part sizes, so overlining does not affect class membership.
Cite this review
Pith. "Pith review of Some Comments on Regular Overpartitions modulo $2^k$." pith.science (2026). https://pith.science/paper/AGRWIX3Z
@misc{pith2026260707259,
author = {Pith},
title = {Pith review of: Some Comments on Regular Overpartitions modulo $2^k$},
year = {2026},
howpublished = {\url{https://pith.science/paper/AGRWIX3Z}},
note = {Machine review of arXiv:2607.07259}
}
abstract
For coprime integers $\ell,\mu\ge 2$, Alanazi, Munagi, and Saikia (2026) studied $\overline{R}_{\ell,\mu}(n)$, the number of overpartitions of $n$ in which no part is divisible by $\ell$ or by $\mu$, together with the single-modulus analogue $\overline{R}_{\ell (n)$. We record a simple combinatorial mechanism that determines both functions modulo every power of $2$ in terms of the number of distinct part sizes of the underlying ordinary partition. We also deduce a clean characterization of $\overline{R}_{\ell}(n)$ and $\overline{R}_{\ell,\mu}(n)$ modulo $4$ in terms of perfect squares.
Reference graph
Works this paper leans on
-
[7]
Kim, A short note on the overpartition function,Discrete Math.309(2009), 2528–2532
B. Kim, A short note on the overpartition function,Discrete Math.309(2009), 2528–2532
work page 2009
-
[3]
A. M. Alanazi, A. O. Munagi, and J. A. Sellers,An infinite family of congruences for ℓ-regular overpartitions, Integers16(2016), #A37, 8 pp
work page 2016
-
[1]
A. M. Alanazi, A. O. Munagi, and M. P. Saikia,Some properties of overpartitions into nonmultiples of two integers, AIMS Math.11(2026), no. 4, 9876–9891
work page 2026
-
[2]
A. M. Alanazi and A. O. Munagi,Combinatorial identities for ℓ-regular overpartitions, Ars Combin. 130(2017), 55–66
work page 2017
-
[4]
A. M. Alanazi, B. Alenazi, W. J. Keith, and A. O. Munagi,Refining overpartitions by properties of non-overlined parts, Contrib. Discrete Math.17(2022), no. 2, 96–111
work page 2022
-
[5]
S. Corteel and J. Lovejoy,Overpartitions, Trans. Amer. Math. Soc.356(2004), no. 4, 1623–1635
work page 2004
-
[6]
Further results on arithmetic properties of biregular overpartitions
S. Ghoshal and A. Jana,Further results on arithmetic properties of biregular overpartitions, arXiv:2504.21439 (2025)
work page Pith review arXiv 2025
-
[8]
B. Paudel, J. A. Sellers, and H. Wang,Extending recent congruence results on( ℓ,µ)-regular overparti- tions, Bol. Soc. Mat. Mex. (3)31(2025), no. 3, Paper No. 135, 24 pp. (A. M. Alanazi)Department of Mathematics, F aculty of Sciences, University of Tabuk, P.O.Box 741, Tabuk 71491, Saudi Arabia Email address:am.alenezi@ut.edu.sa (M. P. Saikia)Mathematical ...
work page 2025
Reviewed July 9, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.