A Sidon set is a set of integers for which all sums
, with
and
, are distinct. For a finite
Sidon set, this condition is equivalent to requiring
that all positive differences between elements be
distinct. Subtracting the minimum element from every
element therefore turns each finite Sidon set into a Golomb
ruler, while every Golomb ruler is a finite Sidon
set.
For example, the marks 0, 1, 4, 9, and 11 form a Sidon set and an optimal five-mark Golomb ruler of length 11.
Let denote the largest possible number
of elements in a Sidon set contained in the interval
, and let
denote the minimum length
of a
-mark Golomb
ruler. Then
|
(1)
|
With , the sizes for
,
1, 2, ... begin 0, 1, 2, 2, 3, 3, 3, 4, ... (OEIS A143824).
Since
is known exactly through
,
this relation determines
exactly for
(distributed.net 2022).
Singer's (1938) construction using a finite projective plane gives the asymptotic lower bound
|
(2)
|
Carter et al. (2025) proved the upper bound
|
(3)
|
Hou and Zhao (2026) subsequently improved this result in a preprint to
|
(4)
|
Carter et al. (2026) further improved the bound to
|
(5)
|
They also proved that the diameter of a
-element Sidon set
is at least
, with the coefficient
improved to 1.88607 for
. Carter et al. (2026)
report that work with AlphaEvolve led to the underlying theoretical framework. Claude
supplied an alternative optimization implementation, checked using human-written
verification code.
The question whether
for every
is problem 30 in the Erdős problems collection.
The improved coefficient of
does not resolve that error-term question.