Erdős Problem #153 — Mean squared gaps in Sidon sumsets
Let be a finite subset of the integers satisfying the Sidon property: if and , then the unordered pairs with repetition are equal, . Write the distinct elements of its sumset in increasing order as
Is it true that, as 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 with , does
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 , then . 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
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
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.