Sparse Ruler

A sparse ruler is a ruler in which some of the distance marks may be missing. More abstractly, a sparse ruler of length $L$ with $m$ marks is a sequence of integers $a_1, a_2, ..., a_m$ where $0 = a_1 < a_2 < ... < a_m = L$. The marks $a_1$ and $a_m$ correspond to the ends of the ruler. In order to measure the distance $K$, with $0\le K\le L$ there must be marks $a_i$ and $a_j$ such that $a_j-a_i=K$.

A ''complete'' sparse ruler allows one to measure any integer distance up to its full length. A complete sparse ruler is called ''minimal'' if there is no complete sparse ruler of length $L$ with $m-1$ marks. In other words, if any of the marks is removed one can no longer measure all of the distances, even if the marks could be rearranged. A complete sparse ruler is called ''maximal'' if there is no complete sparse ruler of length $L+1$ with $m$ marks. A sparse ruler is called ''optimal'' if it is both minimal and maximal.

Since the number of distinct pairs of marks is $m(m-1)/2$, this is an upper bound on the length $L$ of any maximal sparse ruler with $m$ marks. This upper bound can be achieved only for 2, 3 or 4 marks. For larger numbers of marks, the difference between the optimal length and the bound grows gradually, and unevenly.

For example, for 6 marks the upper bound is 15, but the maximal length is 13. There are 3 different configurations of sparse rulers of length 13 with 6 marks. One is . To measure a length of 7, say, with this ruler one would take the distance between the marks at 6 and 13.

A Golomb ruler is a sparse ruler that requires all of the differences $a_j-a_i$ be distinct. In general, a Golomb ruler with $m$ marks will be considerably longer than an optimal sparse ruler with $m$ marks, since $m(m-1)/2$ is a lower bound for the length of a Golomb ruler. A long Golomb ruler will have gaps, that is, it will have distances which it cannot measure. For example, the optimal Golomb ruler has length 17, but cannot measure lengths of 14 or 15.

Wichmann rulers

Many optimal rulers are of the form $W(r,s) = 1^r, r+1, (2r+1)^r, (4r+3)^s, (2r+2)^, 1^r,$ where $a^b$ represents $b$ segments of length $a$. Thus, if $r = 1$ and $s = 2$, then $W(1,2)$ has (in order):

1 segment of length 1,

1 segment of length 2,

1 segment of length 3,

2 segments of length 7,

2 segments of length 4,

1 segment of length 1

That gives the ruler . The length of a Wichmann ruler is $4r(r+s+2)+3(s+1)$ and the number of marks is $4r+s+3$. Note that not all Wichmann rulers are optimal and not all optimal rulers can be generated this way. None of the optimal rulers of length 1, 13, 17, 23 and 58 follow this pattern. That sequence ends with 58 if th
Optimal Ruler Conjecture
of Peter Luschny is correct. The conjecture is known to be true to length 213.

Asymptotics

For every $n$ let $l(n)$ be the smallest number of marks for a ruler of length $n$. For example, $l(6)=4$. The asymptotic of the function $l(n)$ was studied by Erdos, Gal (1948) and continued by Leech (1956) who proved that the limit $\lim_/n$ exists and is lower and upper bounded by
$2+\tfrac=2.424...<2.434...=\max_2(1-\tfrac)\le \lim_\fracn \le\frac=3.348...$

Much better upper bounds exist for $n$-perfect rulers. Those are subsets $A$ of $\mathbb N$ such that each positive number $k\le n$ can be written as a difference $k=a-b$ for some $a,b\in A$. For every number $n$ let $k(n)$ be the smallest cardinality of an $n$-perfect ruler. It is clear that $k(n)\le l(n)$. The asymptotics of the sequence $k(n)$ was studied by Redei, Renyi (1949) and then by Leech (1956) and Golay (1972). Due to their efforts the following upper and lower bounds were obtained:
$\max_2(1-\tfrac)\le \lim_\fracn=\inf_\fracn\le\frac=2.6571...<\frac83.$

Define the excess as $E(n) = l(n)- \lceil \sqrt \rfloor$. In 2020, Pegg proved by construction that $E(n)$ ≤ 1 for all lengths $n$.Pegg, E. Hitting All the Marks: Exploring New Bounds for Sparse Rulers and a Wolfram Language Proof. https://blog.wolfram.com/2020/02/12/hitting-all-the-marks-exploring-new-bounds-for-sparse-rulers-and-a-wolfram-language-proof/ If the Optimal Ruler Conjecture is true, then $E(n) = 0 , 1$ for all $n$, leading to the ″dark mills″ pattern when arranged in columns, OEIS A326499. None of the best known sparse rulers $n > 213$ are proven minimal as of Sep 2020. Many of the current best known $E = 1$ constructions for $n > 213$ are believed to non-minimal, especially the "cloud" values.

Examples

The following are examples of minimal sparse rulers. Optimal rulers are highlighted. When there are too many to list, not all are included. Mirror images are not shown.

Incomplete sparse rulers

A few incomplete rulers can fully measure up to a longer distance than an optimal sparse ruler with the same number of marks. $\$, $\$, $\$, and $\$ can each measure up to 18, while an optimal sparse ruler with 7 marks can measure only up to 17. The table below lists these rulers, up to rulers with 13 marks. Mirror images are not shown. Rulers that can fully measure up to a longer distance than any shorter ruler with the same number of marks are highlighted.

See also

* Gauge block
* Golomb ruler
* Perfect ruler

HOME


Content is Copyleft
Website design, code, and AI is Copyrighted (c) 2014-2017 by Stephen Payne


Consider donating to Wikimedia



As an Amazon Associate I earn from qualifying purchases