REVIEW 2 major objections 5 minor 8 references
On the Thickness of Infinite Generalized Sidon Sets, I
T0 review · 2 major / 5 minor · reviewed 2026-08-02 · deepseek-v4-flash
Pith's one-line read Every infinite γ-Golomb ruler must, at arbitrarily large scales, contain at most 2√γ/√(log 2) · √(n/log n) elements up to n.
desk verdict Sharp constant 2/√log2 for infinite γ-Golomb rulers, proved by a clean optimized energy argument; the paper is sound modulo cosmetic fixes. 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 object is the block energy E = Σℓ Fℓ², where Fℓ is the number of elements of A in the ℓ-th interval of length N. The γ-Golomb property forces E ≤ γN + o(N) because each difference d < N is counted at most γ times. A weighted Cauchy inequality with weights wℓ = (ℓ log(eℓN))^{-1/2} bounds E from below by τ_N² (log 2)/4 · N + o(N), where τ_N is the infimum of A(n)√(ψ(n)/n) for n ≥ N; two elementary estimates — Σ wℓ² ≤ log 2 + o(1) and Σ wℓ βℓ ≥ (log 2/2)√N + o(√N) with βℓ = √(ℓN/ψ(ℓN)) — supply the constants. For Theorem 2, a separate merging lemma glues finite optimal rulers into an infinite ruler, discarding at most γ·(|V| choose 2) elements at each step.
What would settle it
The theorem falls if there exists an infinite γ-Golomb ruler with A(n) > (2√γ/√(log 2) + ε)·√(n/log n) for all large n; a computational search over prime-power-based constructions for large N (say up to 10⁶) would probe this directly. The most localized check is to evaluate the weighted sum Σℓ wℓ βℓ at N = 10⁶ and verify the claimed asymptotic (log 2/2)√N + o(√N), since the displayed antiderivative in the proof is not literally correct at that step.
Extended reading notes
Core claim
For any γ ≥ 1, no infinite set of integers with at most γ representations of every positive difference can be denser, in liminf, than 2√γ/√(log 2) ≈ 2.40√γ times √(n/log n). The proof is an energy argument: split the set into blocks of length N; the γ-Golomb condition bounds the sum of squared block counts from above by γN + o(N), while a weighted Cauchy inequality bounds the same sum from below by τ_N² (log 2)/4 · N + o(N), where τ_N is the minimal value of A(n)√(ψ(n)/n) for n ≥ N. The two bounds force τ_N ≤ 2√γ/√(log 2). The same paper shows every γ-Golomb ruler has limsup of A(n)/√n at most √γ, and constructs a γ-Golomb ruler achieving at least √γ/√2, so the limsup density is determined u
Load-bearing premise
The proof depends on a quoted lemma asserting that any finite γ-Golomb ruler with diameter N has at most √(γN) + o(√N) elements; if that bound is not as strong as quoted, the error terms in the energy estimate cease to be negligible and the constant 2√γ/√(log 2) does not follow.
Editorial extensions
If this is right
- For Sidon sets (γ = 1), the liminf of A(n)/√(n/log n) is at most 2/√(log 2) ≈ 2.40, improving the previous constant of 8√7 ≈ 21.2.
- No infinite γ-Golomb ruler can exceed the threshold (2√γ/√(log 2) + ε)·√(n/log n) for every large n; there must be scales where the set is at most the bound.
- Every γ-Golomb ruler satisfies limsup A(n)/√n ≤ √γ, and the constructed example attains at least √γ/√2, leaving only a factor √2 of uncertainty in the limsup density.
- The paper's block-energy approach is presented as fully optimized within its own framework, identifying the remaining open problem as improving the constants or closing the √2 gap between the lower and upper limsup bounds.
Reading between the lines
- The same energy estimate should apply to finite γ-Golomb rulers: any finite ruler in [0,N) with close to √(γN) elements must have some block of length N/log N containing unusually few elements, a 'discrepancy' statement that could be tested computationally on known prime-power constructions.
- The liminf bound is consistent with existing constructions whose counting function grows like n^{0.414}, which have liminf 0; the theorem's content is an upper ceiling on the liminf, so it leaves open whether any γ-Golomb ruler can actually attain the constant 2√γ/√(log 2).
- The weighted-Cauchy machinery is a second-moment estimate; replacing the ℓ² energy by ℓ^p sums could yield constraints on the fluctuations of A across blocks, predicting how 'clumpy' any γ-Golomb ruler must be at the scale N/log N.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies infinite γ-Golomb rulers, i.e., sets of nonnegative integers in which every positive difference has at most γ representations. Theorem 1 asserts that for every such set A, liminf_{n→∞} |A∩[0,n)| / sqrt(n/log n) ≤ 2√γ / √(log 2), improving the previous constant for Sidon sets and extending the result to γ>1. The proof partitions A into blocks of length N, considers an energy functional, and derives matching upper and lower bounds using the γ-Golomb property and Cauchy's inequality with logarithmic weights. Theorem 2 gives an elementary upper bound limsup |A∩[0,n)|/√n ≤ √γ and constructs a γ-Golomb ruler with limsup at least √(γ/2), generalizing Krückeberg's construction. The paper is clearly written and the main energy argument is largely correct, but one displayed definition is inverted and needs correction.
Significance. If the proof is repaired, the constant 2/√(log 2) ≈ 2.40 is a substantial improvement over the previous 21.2 and appears to be the first explicit constant for the γ>1 analogue at the liminf scale. The construction in Theorem 2 is clean and nearly matches the elementary upper bound. The proof is elementary, self-contained apart from quoted lemmas, and uses no fitted parameters. The method of block energies with logarithmic weights is likely to be useful. However, the manuscript in its current form contains a load-bearing inconsistency in the definition of τ_N, so the significance is conditional on a small but essential correction.
major comments (2)
- [Section 3, Eq. (3)] The definition of τ_N is inverted. As printed, τ_N = inf_{n≥N} A(n)/sqrt(ψ(n)/n) = inf_{n≥N} A(n)·sqrt(n/ψ(n)). For any infinite A, A(n)≥1, so this quantity tends to infinity, and the later inequality a_ℓ ≥ τ_N β_ℓ (used in Claim 6) is false. The proof only works with τ_N = inf_{n≥N} A(n)/sqrt(n/ψ(n)) = inf_{n≥N} A(n)·sqrt(ψ(n)/n), which is the quantity whose liminf is controlled by Theorem 1. This is load-bearing: the lower energy bound and the final inequality in the proof depend on this definition. The fix is a one-character correction in (3), after which the proof's subsequent steps are consistent with the theorem statement.
- [Section 3, Claim 6] The absorption of the boundary term into o(√N) is not justified as written. The negative term is −τ_N w_{M'}β_{M'}, and w_{M'}β_{M'} = √N/ψ(M'N). Since τ_N can grow, this product is not automatically o(√N). With the corrected definition of τ_N, Lemma 3's crude bound gives τ_N ≤ 3√γ√ψ(N) = O(√log N), so τ_N · √N/ψ(M'N) = O(√N/√log N) = o(√N). This line should be added to make Claim 6 rigorous; without it, the displayed o(√N) in the lower bound is not established.
minor comments (5)
- [Section 3, Claim 6] The displayed equality w_{M'}β_{M'} = √M'/ψ(M'N) is incorrect; the correct value is √N/ψ(M'N). Since both are o(√N), the subsequent conclusion is unaffected.
- [Section 3, Eq. (2) and proof of Theorem 1] The quantity M = N/ψ(N) is real but is used as an upper summation limit. The proof should consistently use ⌊M⌋ or define M as an integer with M∼N/ψ(N). This is a presentation issue but affects rigor.
- [Section 3, Claim 5] The phrase 'routine calculus' contains a garbled expression: 'log(e x/log(ex)·x)/log(ex) increases to 2'. Please rewrite the estimate for Σ w_ℓ² clearly.
- [Section 3, Claim 6] For the record, the antiderivative of w(x)β'(x) displayed in the proof is correct: ∫ wβ' = (√N/2)(log(ψ(xN)/ψ(N)) − log x/(ψ(N)ψ(xN))) evaluated between the endpoints. No correction is needed there.
- [Section 2, Lemma 3] The proof uses Lemma 3 only through the crude bound |A∩[0,L)| ≤ 3√(γL); the asymptotic form |A|≤√(γN)+o(√N) is not needed for the main argument. This could be stated to avoid the impression that a deep result is load-bearing.
Circularity Check
No significant circularity: the proof derives the bounds from external lemmas and standard inequalities, with no fitted input or load-bearing self-citation.
full rationale
The paper's derivation is a conventional analytic proof. Theorem 1's constant is obtained by bounding an energy E from above via the γ-Golomb condition (Line (4) through (6)) and from below via Cauchy's inequality with explicit weights, then comparing as N→∞. The only imported results are Lemmas 3 and 4, quoted from the external paper by Caicedo, Martos, and Trujillo [1]; these are not self-citations and are used in a deliberately crude form (e.g., |A| ≤ 3√(γN)). The author's own cited work [5] appears only as a bibliographic pointer in the introduction and plays no role in any proof. The 'Nonrigorous thoughts' subsection is explicitly speculative and disclaimed, and does not enter the argument. There is no fitted parameter renamed as a prediction, no definition that presupposes the target inequality, and no self-citation chain carrying the derivation. Accordingly, no circular step is present.
Assumptions & free parameters
assumptions (5)
- standard math Cauchy–Schwarz inequality with chosen weights wℓ
- domain assumption Finite γ-Golomb ruler bound (Lemma 3): |A| ≤ (γN)^{1/2}+(γN)^{1/4}+1
- domain assumption Existence of finite γ-Golomb rulers of size q (Lemma 4) for q ≡ 1 mod γ
- domain assumption Existence of a prime power q≥3 with q ≡ 1 (mod γ) for every positive integer γ
- standard math Calculus identities for ψ(x)=log(exN), including monotonicity and antiderivative estimates in Claims 5 and 6
Cite this review
Pith. "Pith review of On the Thickness of Infinite Generalized Sidon Sets, I." pith.science (2026). https://pith.science/paper/NNKO2Z37
@misc{pith2026260628651,
author = {Pith},
title = {Pith review of: On the Thickness of Infinite Generalized Sidon Sets, I},
year = {2026},
howpublished = {\url{https://pith.science/paper/NNKO2Z37}},
note = {Machine review of arXiv:2606.28651}
}
abstract
Let $g \ge1$. A set $\mathcal{A}$ of nonnegative integers is a Sidon set if for each $d>0$ there is at most one pair $(a,b) \in \mathcal{A} \times \mathcal{A}$ with $d=a-b$. If there are at most $g$ pairs, then $\mathcal{A}$ is a $g$-Golomb ruler. We prove that if $\mathcal{A}$ is a $g$-Golomb ruler, then \[\liminf_{n\to\infty} \frac{ | \mathcal{A}\cap[0,n) | }{\sqrt{n/\log n}} \le \frac{2\sqrt g }{\sqrt{\log 2}},\] generalizing and sharpening results of Erd\H{o}s and Cilleruelo. There is a $g$-Golomb ruler $\mathcal{G}$ with \[\frac{\sqrt g }{\sqrt2} \le \limsup_{n\to\infty} \frac{ | \mathcal{G}\cap[0,n) | }{\sqrt n} \le \sqrt{g } ,\] generalizing a result of Kr\"uckeberg.
Reference graph
Works this paper leans on
-
[8]
Alfred St¨ ohr,Gel¨ oste und ungel¨ oste Fragen ¨ uber Basen der nat¨ urlichen Zahlenreihe I, II, J. Reine Angew. Math.194(1955), 40–65, 111–140, DOI 10.1515/crll.1955.194.40, 10.1515/crll.1955.194.111. 12
-
[1]
Yadira Caicedo, Carlos A. Martos, and Carlos A. Trujillo,g-Golomb rulers, Rev. Integr. Temas Mat.33(2015), no. 2, 161–172, DOI 10.18273/revint.v33n2-2015006 (English, with English and Spanish summaries)
-
[2]
Lecture notes, AGRA II: Ar- itm´ etica, grupos y an´ alisis, ICTP-CIMPA Research School, Universidad San Antonio Abad, Cusco, Peru, 8–22 August 2015
Javier Cilleruelo,Conjuntos de Sidon, 2015 (Spanish). Lecture notes, AGRA II: Ar- itm´ etica, grupos y an´ alisis, ICTP-CIMPA Research School, Universidad San Antonio Abad, Cusco, Peru, 8–22 August 2015
2015
-
[3]
Halberstam and K
H. Halberstam and K. F. Roth,Sequences. Vol. I, Clarendon Press, Oxford, 1966
1966
-
[4]
Fritz Kr¨ uckeberg,B2-Folgen und verwandte Zahlenfolgen, J. Reine Angew. Math.206 (1961), 53–60, DOI 10.1515/crll.1961.206.53
-
[5]
Kevin O’Bryant,A complete annotated bibliography of work related to Sidon sequences, Electron. J. Combin.DS11(2004), 39
2004
-
[6]
Carlos Andres Martos Ojeda, David Fernando Daza Urbano, and Carlos Alberto Tru- jillo Solarte,Near-optimalg-Golomb rulers, IEEE Access9(2021), 65482–65489, DOI 10.1109/ACCESS.2021.3075877
arXiv 2021
-
[7]
Ruzsa,An infinite Sidon sequence, J
Imre Z. Ruzsa,An infinite Sidon sequence, J. Number Theory68(1998), no. 1, 63–71, DOI 10.1006/jnth.1997.2192
arXiv 1998
Reviewed August 2, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.