Erdős Problem #156 — Small maximal Sidon sets
For a positive integer , write . A set is Sidon if sums of unordered pairs of its elements, with repetition allowed, are all distinct; equivalently, whenever and are in and , one has and . It is maximal in if no element of can be adjoined while preserving the Sidon property; maximal here means inclusion-maximal, not maximum cardinality. The question is whether there are constants and such that for every integer there exists an inclusion-maximal Sidon set with Erdős Problems #156 O’Bryant (2004)
Background
The question is attributed to Erdős, Sárközy, and Sós, whose 1994 paper is titled “On Sum Sets of Sidon Sets, I.” Maximality is a local obstruction condition: every omitted integer must create a repeated pair-sum if added. This differs from asking for a Sidon set of largest possible size, which is a maximum-cardinality problem. Erdős Problems #156 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.