Erdős Problem #1191 — Logarithmic density scale of infinite Sidon sets
Let denote the positive integers. A set is a Sidon set if every equality , with (allowing repeated elements), implies equality of the unordered pairs with multiplicity: . For real , write
For every infinite Sidon set , must one have
Conversely, does there exist an infinite Sidon set and a constant such that
Erdős Problem #1191 Erdős (1980)
Background
Sidon introduced these sequences around 1932–33 while studying questions connected with lacunary trigonometric series, and asked how slowly a sequence with distinct pair sums could grow. The counting function makes that growth question quantitative: the two questions here concern how close an infinite Sidon set can come to the square-root scale, including logarithmic factors. Erdős (1980)
References
P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.
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.