Erdős Problem #530 — Guaranteed Sidon subsets of real sets
For each positive integer , define the guaranteed Sidon-subset size by
Here is Sidon if, for every , the equation implies or . Determine the asymptotic order of ; in particular, is ? Erdős Problems #530
Background
Sidon sets, also called -sets, forbid nontrivial coincidences between sums of two elements. Their study began with Sidon’s work connected to Fourier series, including the problem of finding large Sidon subsets of an interval of integers. The present question, originally asked by Riddell, asks how much of this interval phenomenon must persist when the ambient set is an arbitrary finite subset of the reals. Erdős Problems #530 On the largest Sidon subset in a finite subset of ℝ^N
The interval case provides the sharp scale for an upper bound: a set of consecutive integers has largest Sidon subsets of size asymptotic to . Erdős’s early bounds for the arbitrary-set problem gave a lower bound of order , while Komlós, Sulyok, and Szemerédi later reached the square-root scale. Erdős’s conjectural target is that the interval-scale upper bound is also attained as a guarantee for every real set. Erdős Problems #530 On the largest Sidon subset in a finite subset of ℝ^N
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.