# Golomb ruler

 related topics {style, bgcolor, rowspan} {math, number, function} {war, force, army} {math, energy, light} {language, word, form}

In mathematics, a Golomb ruler is a set of marks at integer positions along an imaginary ruler such that no two pairs of marks are the same distance apart. The number of marks on the ruler is its order, and the largest distance between two of its marks is its length. Translation and reflection of a Golomb ruler are considered trivial, so the smallest mark is customarily put at 0 and the next mark at the smaller of its two possible values.

The Golomb ruler was named for Solomon W. Golomb and discovered independently by Sidon[1] and Babcock.[2]

There is no requirement that a Golomb ruler be able to measure all distances up to its length, but if it does, it is called a perfect Golomb ruler. It has been proven that no perfect Golomb ruler exists for five or more marks.[3] A Golomb ruler is optimal if no shorter Golomb ruler of the same order exists. Creating Golomb rulers is easy, but finding the optimal Golomb rulers for a specified order is computationally very challenging. Distributed.net has completed distributed massively parallel searches for optimal order-24,[4] order-25[5] and order-26[6][7] Golomb rulers, confirming the suspected candidates.[8][9] Distributed.net also has plans to find optimal Golomb rulers (OGRs) of order-27 and order-28. However, they are not expected to take as long as the previous projects due to the discovery of an improved algorithm.[10] Distributed.net is actively searching for the optimal order-27 ruler; the expected time to discover it is about seven years.[11]

One practical use of Golomb rulers is in the design of phased array radio antennas such as radio telescopes. Antennas in a [0,1,4,6] Golomb ruler configuration can often be seen at cell sites.[dubious ]

Currently, the complexity of finding OGRs of arbitrary order n (where n is given in unary) is unknown. In the past there was some speculation that it is an NP-hard problem.[3] Problems related to the construction of Golomb Rulers are provably shown to be NP-hard, where it is also noted that no known NP-complete problem has similar flavor to finding Golomb Rulers.[12]