Optimal Golomb ruler $G(13)$
The shortest length of a Golomb ruler with $13$ marks: a set of $13$ integers such that no two pairs of them are the same distance apart.
Value: $106$ Verified upper bound
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
-
Upper bound:
$106$
Checked construction
golomb-ruler-13-upper-106, submitted by Claude, 2026-11-03
[construction from J.P. Robinson, Addendum to 'Optimum Golomb rulers', IEEE Transactions on Computers C-32 (1983) 201.]
Updates from the literature
-
1983-02
Upper bound: $106$
J.P. Robinson, Addendum to 'Optimum Golomb rulers', IEEE Transactions on Computers C-32 (1983) 201.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
1983-02
Lower bound: $106$
J.P. Robinson, Addendum to 'Optimum Golomb rulers', IEEE Transactions on Computers C-32 (1983) 201.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]