Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Write Sr(N)S_r(N) for the largest size of a set A⊆{1,…,N}A\subseteq\{1,\ldots,N\} in which every integer has at most rr representations a+a′a+a' with a≤a′a\le a', and Dr(N)D_r(N) for the largest size of a set B⊆{1,…,N}B\subseteq\{1,\ldots,N\} in which every nonzero difference has at most rr ordered representations b−b′b-b'. Ho proves (Theorem 1 of the write-up) that for every fixed r≥2r\geq 2, with s=⌊r/2⌋s=\lfloor r/2\rfloor,

lim sup⁡N→∞Dr(N)N≤r<r+sr+2s≤lim inf⁡N→∞Sr(N)N.\limsup_{N\to\infty}\frac{D_r(N)}{\sqrt N} \leq \sqrt r < \frac{r+s}{\sqrt{r+2s}} \leq \liminf_{N\to\infty}\frac{S_r(N)}{\sqrt N}.

If the constants crc_r and cr′c_r' of the statement exist, then cr′≤r<crc_r'\leq\sqrt r<c_r, so both questions are answered yes: cr≠cr′c_r\neq c_r' and cr′<crc_r'<c_r for every r≥2r\geq 2. The separation holds without assuming that either limit exists.

The upper bound adapts the Erdős–Turán argument for Sidon sets: counting pairs of elements of BB inside windows of length HH by Cauchy–Schwarz and by the difference bound gives ∣B∣2≤rN+o(N)|B|^2\leq rN+o(N) for H=⌊N2/3⌋H=\lfloor N^{2/3}\rfloor. The lower bound is the finite B2[g]B_2[g] construction of Cilleruelo, Ruzsa and Trujillo (Theorem 2.1 of cilleruelo_2002_upper_lower_bounds_finite_b_h, J. Number Theory 97 (2002), 26–34), re-proved in the write-up: a Singer cyclic Sidon set of size q+1q+1 modulo q2+q+1q^2+q+1 is lifted along the pattern {0,…,r−1}∪{r+s,…,r+2s−1}\{0,\ldots,r-1\}\cup\{r+s,\ldots,r+2s-1\}, which has at most rr ordered representations of every sum, and the prime number theorem supplies a prime qq of the right size. For r=2r=2 the bounds read c2′≤2c_2'\leq\sqrt2 and c2≥3/2c_2\geq 3/2.

The write-up was posted on 2026-04-22. A revision of 2026-05-03 adds an acknowledgement that GPT-5.4 Pro contributed materially to the arguments, proofs and exposition, and that the author accepts responsibility for the final text; the mathematics is unchanged. The site credits the observation to Ho and GPT-5.4 Pro.

Acceptance. The site's curator, T. F. Bloom, accepted the argument: the problem is labeled proved and the remarks state the two bounds and the resulting inequality (page last edited 2026-04-24), two days after the write-up was posted to the forum. That is the reviewed evidence. The construction half is refereed as part of the Cilleruelo–Ruzsa–Trujillo paper, but the write-up itself and the inequality it draws are not refereed, so the claim lists no refereed evidence.

Depends on. Nothing in this wiki; the inputs are the refereed construction cited above and the elementary window count.