REVIEW 4 minor 5 references
A Local Classification of Four-Element Multiple Sumsets
T0 review · 0 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash
Pith's one-line read For four-element sets, the h-fold sumset can never have size 5h.
desk verdict Small, honest, correct classification paper that settles Rajagopal's 5h conjecture with a clean diameter-five reduction; peer-review worth it, but don't oversell scope. 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 load-bearing tool is Lev's lower bound on successive growth of multiple sumsets: for a normalized set B with k elements and diameter d, the increment |iB|-|(i-1)B| is at least min{d, i(k-2)+1} for every i at least 2. Applied to four-element sets, this bound rules out all affine diameters except 5: diameter at most 4 gives an immediate upper-bound contradiction, and diameter at least 6 forces growth of at least 6 per step, exceeding the allowed ceiling. The remaining six normalized sets, {0,a,b,5} with two interior elements, are handled by a reflection symmetry and four exact sumset identities.
What would settle it
Exhaustively enumerate normalized sets {0,a,b,d} with 0<a<b<d and d large enough, for h in, say, 4 to 20, and compute |hA|: any occurrence of 5h, or for h at least 6 any value in [5h+2, 6h-4], would disprove Theorem 1. Alternatively, search for a four-element normalized B with diameter d at least 6 and some i at least 3 such that |iB|-|(i-1)B| is less than min{d, 2i+1}; that would refute Lev's bound and the diameter reduction.
Extended reading notes
Core claim
The central claim is Theorem 1: for every integer h at least 4, the possible sizes of |hA| for a four-element set A that lie in [4h+2, 6h-4] are exactly {5h-1} when h=4, and {5h-1, 5h+1} when h is at least 5. Equivalently, 5h is never present, settling Rajagopal's gap conjecture, and for h at least 6 the entire interval [5h+2, 6h-4] is excluded, going beyond Rajagopal's general missing set. The proof classifies the normalized shape: if |hA| falls in this band, the affine diameter of A must be 5, and among all normalized four-element sets of diameter 5, only four types (up to reflection) matter, with explicit h-fold sumset formulas giving cardinalities 5h-1 or 5h+1.
Load-bearing premise
The whole reduction to affine diameter 5 relies on Lev's theorem as an unproved external inequality; if that inequality ever fails for a four-element normalized set of diameter at least 6, the argument that rules out all such diameters collapses.
Editorial extensions
If this is right
- Rajagopal's conjectured gap 5h not in R(h,4) is now a theorem for every h at least 4.
- For h at least 6, no four-element set has an h-fold sumset of any size between 5h+2 and 6h-4; this blank interval is new and lies outside the range excluded by Rajagopal's general result.
- The four explicit formulas in Lemma 7 give exact descriptions of the h-fold sumsets of the extremal diameter-five sets, not just their sizes.
- Since 5h-1 and 5h+1 are both attained (by {0,1,2,5} and {0,1,4,5}), the classification is sharp on both ends of the interval for h at least 5.
Reading between the lines
- The same diameter-reduction strategy may extend to larger set sizes k: if Lev's bound is combined with matching upper and lower interval bounds, one might classify R(h,k) in a band such as [kh+2, (k+1)h-4] by enumerating only finitely many normalized sets of small affine diameter.
- The new missing interval [5h+2, 6h-4] suggests that forbidden zones in R(h,k) may be more extensive than the general excluded set from the earlier work; probing intervals just above 6h could reveal further gaps.
- A direct test of the method's reach would be to compute R(h,5) in the analogous range for small h, say h up to 10, and see whether the same 'only one or two diameters survive' pattern emerges.
- Because Lev's bound is the only external ingredient, replacing it with an elementary proof for the needed special case (k=4, d at least 6) would make the classification self-contained.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper determines, for every h ≥ 4, the possible cardinalities |hA| for four-element subsets A of Z in the interval [4h+2, 6h−4]. Theorem 1 states that the only such size is 5h−1 for h = 4, and {5h−1, 5h+1} for h ≥ 5; consequently, 5h is never in R(h,4), confirming a conjecture of Rajagopal. The proof normalizes A by its affine diameter, applies Lev's lower bound for successive sumset growth to rule out diameter not equal to 5, enumerates the six normalized diameter-five sets, uses reflection symmetry to reduce to four representatives, and computes those h-fold sumsets by elementary interval-union inductions. A supplementary finite computational check is provided and is explicitly not used in the proof.
Significance. The result is a clean, local contribution to the determination of R(h,k). It resolves a published conjecture and, for h ≥ 6, pushes the known missing interval beyond Rajagopal's general excluded set. The proof is short and, apart from Lev's external theorem, completely elementary; the four sumset identities are verified by transparent inductions. The paper is strengthened by the accompanying independent finite verification, which audits the case analysis and the application of Lev's bound. This is a modest but solid advance suitable for a combinatorics journal.
minor comments (4)
- [Computational check] The displayed command 'python3 verify rajagopal.py --max-d 50 --max-h 30' appears to have a missing underscore in the script name (likely verify_rajagopal.py), so it is not executable as printed. Also, the thousands-separated counts '449,496' and '482,792' could be misread as lists; consider writing 449496 and 482792 or using narrow spaces.
- [Introduction] The symbol Δ_{h,4} from [2] is mentioned but not defined. A one-line definition, or a precise statement of which interval is excluded, would make the comparison in the introduction self-contained.
- [Lemma 3] The arrow in 'the map hA− → hB' appears to contain a typographical artifact (an extra minus sign). It should read 'hA → hB'.
- [Section 3] When reflection is used to reduce the six diameter-five sets to four representatives, it might be worth stating explicitly that the reflection x ↦ 5−x preserves normalization (min 0, gcd 1, max 5). This is immediate from the definitions but would make the reduction fully transparent.
Circularity Check
No significant circularity: the classification is derived from an external theorem plus elementary case analysis.
full rationale
The paper's derivation is self-contained apart from Lev's theorem. Theorem 1 is obtained by a finite case split after applying Lev's lower bound (Theorem 4, quoted from [1]) under hypotheses checked in Lemma 3; that theorem is external to the paper and does not assume the target result. For d≤4 the bound |hB|≤4h+1 is trivial containment, and for d≥6 Lev's bound yields |hB|≥6h−3, neither of which encodes 5h∉R(h,4). The remaining diameter-five cases are enumerated explicitly as {0,a,b,5}, and Lemma 7 proves the four sumset identities by elementary interval-union inductions. The cardinalities 5h−1 and 5h+1, and the absence of 5h, are consequences of those identities rather than fitted inputs. There is no load-bearing self-citation: Rajagopal [2] is cited for context and for the conjectured gap, which the paper then proves, and Lev [1] is a prior external theorem. The computational check is explicitly stated not to be used in the proof. No circular step, renamed assumption, or prediction-by-construction appears in the derivation chain.
Assumptions & free parameters
assumptions (1)
- domain assumption Lev's lower bound for successive multiple sumset growth (Theorem 4)
Cite this review
Pith. "Pith review of A Local Classification of Four-Element Multiple Sumsets." pith.science (2026). https://pith.science/paper/J3CZK7VD
@misc{pith2026260718694,
author = {Pith},
title = {Pith review of: A Local Classification of Four-Element Multiple Sumsets},
year = {2026},
howpublished = {\url{https://pith.science/paper/J3CZK7VD}},
note = {Machine review of arXiv:2607.18694}
}
abstract
For a finite set $A\subset\mathbb{Z}$, write $hA$ for its $h$-fold sumset, and let \[ R(h,k)=\{|hA|:A\subset\mathbb{Z},\ |A|=k\}. \] We determine the part of $R(h,4)$ lying between $4h+2$ and $6h-4$: for $h=4$ the only value is $5h-1$, while for $h\geq 5$ the only values are $5h-1$ and $5h+1$. This proves Rajagopal's conjectured gap $5h\notin R(h,4)$ for every $h\geq 4$. For $h\geq 6$, it also yields the new missing interval $[5h+2,6h-4]$, which lies outside Rajagopal's general excluded set. Lev's lower bound for the successive growth of multiple sumsets reduces the problem to normalized sets of affine diameter five, of which there are only six. Reflection and four elementary exact sumset computations finish the classification.
Reference graph
Works this paper leans on
-
[1]
V. F. Lev, Structure theorem for multiple addition and the Frobenius problem,J. Number Theory58(1996), no. 1, 79–88.https://doi.org/10.1006/jnth.1996.0065
arXiv 1996
-
[2]
Rajagopal, Possible sizes of sumsets,Discrete Analysis(2026), Paper No
I. Rajagopal, Possible sizes of sumsets,Discrete Analysis(2026), Paper No. 2. https://doi.org/ 10.19086/da.165102; arXiv:2510.23022 [math.CO].https://arxiv.org/abs/2510.23022
arXiv 2026
-
[3]
M. B. Nathanson, Problems in additive number theory, VI: Sizes of sumsets of finite sets,Acta Math. Hungar.176(2025), 498–521
2025
-
[4]
Schinina, On the sumset of sets of size k,Integers26(2026), Paper No
V. Schinina, On the sumset of sets of size k,Integers26(2026), Paper No. A31. https: //math.colgate.edu/~integers/aa31/aa31.pdf
2026
-
[5]
Tang and Y
M. Tang and Y. Xing, Some inverse results of sumsets,Bull. Korean Math. Soc.58(2021), no. 2, 305–313. 5
2021
Reviewed August 1, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.