Erdős Problem #840 — Quasi-Sidon sets in intervals
For a finite set , write , and let . The question calls quasi-Sidon when, along sets with , the number of distinct sums satisfies
It asks for the asymptotic growth of the largest possible size of such a subset of . Thus the is an asymptotic condition on the sets under consideration, rather than a finite- test with a specified error tolerance. Bloom, Erdős Problem #840 Pikhurko, Dense Edge-Magic Graphs and Thin Additive Bases
Background
The condition asks for a set whose pairwise sums are nearly as numerous as the pairs of elements: additive coincidences must be sparse on the scale of . It is weaker than the Sidon property, which requires distinct unordered pairs to have distinct sums. Erdős and Freud considered the quasi-Sidon extremal question; the problem record also traces the bounds to earlier work of Erdős. Bloom, Erdős Problem #840 Erdős and Freud, On sums of a Sidon-sequence (1991)
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.