← All problems

Erdős Problem #153 — Mean squared gaps in Sidon sumsets

32 years old · traced to

Let AA be a finite subset of the integers satisfying the Sidon property: if a,b,c,d∈Aa,b,c,d\in A and a+b=c+da+b=c+d, then the unordered pairs with repetition are equal, {a,b}={c,d}\{a,b\}=\{c,d\}. Write the distinct elements of its sumset in increasing order as

A+A={s1<s2<⋯<st},t=∣A+A∣.A+A=\{s_1<s_2<\cdots<s_t\},\qquad t=|A+A|.

Is it true that, as ∣A∣|A| tends to infinity through finite Sidon sets, the mean squared gap between consecutive elements of the sumset tends to infinity; that is, for every sequence of such sets AjA_j with ∣Aj∣→∞|A_j|\to\infty, does

1tj∑i=1tj−1(si+1−si)2⟶∞,Aj+Aj={s1<⋯<stj},\frac{1}{t_j}\sum_{i=1}^{t_j-1}(s_{i+1}-s_i)^2\longrightarrow\infty, \qquad A_j+A_j=\{s_1<\cdots<s_{t_j}\},

hold? Erdős Problem #153 O’Bryant (2004)

Background

Sidon sets arose from Sidon’s 1932 study of sets with few additive representations. For integer sets, the defining restriction can equivalently be expressed by saying that no nonzero difference occurs more than once. In the sumset, each unordered pair of elements, allowing a repeated element, therefore contributes a different sum; in particular, if ∣A∣=n|A|=n, then ∣A+A∣=n(n+1)/2|A+A|=n(n+1)/2. O’Bryant (2004)

The question is recorded in connection with Erdős, Sárközy, and Sós’s 1994 paper on sumsets of Sidon sets. It concerns not just how many sums occur, but how the ordered sums are spaced: the statistic weights a gap quadratically, so a few large gaps can matter even when the sumset has quadratically many elements. Erdős Problem #153 O’Bryant (2004) Erdős, Sárközy, and Sós (1994)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.