稀疏尺

稀疏尺（Sparse ruler）指的是去掉了一些刻度的尺子。抽象来说，一个长度为 L {\displaystyle L} ，有 m {\displaystyle m} 个刻度的稀疏尺可以被记为整数序列 a 1 , a 2 , . . . , a m {\displaystyle a_{1},a_{2},...,a_{m}} ( 0 = a 1 < a 2 < . . . < a m = L {\displaystyle 0=a_{1}<a_{2}<...<a_{m}=L} )。刻度 a 1 {\displaystyle a_{1}} 和 a m {\displaystyle a_{m}} 对应尺子的首尾。为了能够测量长度 K {\displaystyle K} （ 0 ≤ K ≤ L {\displaystyle 0\leq K\leq L} ），我们需要存在刻度 a i {\displaystyle a_{i}} , a j {\displaystyle a_{j}} 使得 a j − a i = K {\displaystyle a_{j}-a_{i}=K} 。 如果一个稀疏尺能够测量不超过它的长度的任意整数长度，称这个稀疏尺是完全的。对于一个完全稀疏尺，如果不存在另一个长度相同但刻度数量更少的完全稀疏尺，则称它是最小稀疏尺。类似的，如果不存在另一个刻度数量相同但长度更大的稀疏尺，则称它是最大稀疏尺。如果一个稀疏尺既是最大稀疏尺，又是最小稀疏尺，则称它是最优稀疏尺。 对于 m {\displaystyle m} 个刻度，不同的刻度组合共有 m ( m − 1 ) / 2 {\displaystyle m(m-1)/2} 种，因此这是长度 L {\displaystyle L} 的理论上界。事实上，只有在2、3或4个刻度的情况下可以取到该上界。对于更多的刻度数量，最优长度和理论上界的差距非均匀地逐渐增大。 例如，对于 6 个刻度的稀疏尺，理论上界为 15，但实际上的最大长度为 13。长度为13，刻度数为6的稀疏尺有三种可能的刻度选择。其中之一是是 {0, 1, 2, 6, 10, 13}。例如，要测量7的长度，可以使用这把尺子的刻度6和13。 格伦布尺是一种要求所有的 a j − a i {\displaystyle a_{j}-a_{i}} 都不相等的稀疏尺。通常， m {\displaystyle m} 个刻度的格伦布尺将比 m {\displaystyle m} 个刻度的最佳稀疏尺长得多，因为 m ( m − 1 ) / 2 {\displaystyle m(m-1)/2} 是格伦布尺长度的下界。比较长的格伦布尺可能有间隙，换句话说，它可能有无法测量的距离。例如，最优格伦布尺 {0, 1, 4, 10, 12, 17} 的长度为 17，但它无法测量长度 14 或 15。 许多最优尺符合以下形式： W ( r , s ) = 1 r , r + 1 , ( 2 r + 1 ) r , ( 4 r + 3 ) s , ( 2 r + 2 ) ( r + 1 ) , 1 r , {\displaystyle W(r,s)=1^{r},r+1,(2r+1)^{r},(4r+3)^{s},(2r+2)^{(r+1)},1^{r},} a b {\displaystyle a^{b}} 代表 b {\displaystyle b} 段长度为 a {\displaystyle a} 的间隔。因此，如果 r = 1 {\displaystyle r=1} ， s = 2 {\displaystyle s=2} ，则 W ( 1 , 2 ) {\displaystyle W(1,2)} 有（按顺序）： 1段长度为1的间隔， 1段长度为2的间隔， 1段长度为3的间隔， 2段长度为7的间隔， 2段长度为4的间隔， 1段长度为1的间隔。 对应稀疏尺 {0, 1, 3, 6, 13, 20, 24, 28, 29}。威希曼尺的长度为 4 r ( r + s + 2 ) + 3 ( s + 1 ) {\displaystyle 4r(r+s+2)+3(s+1)} ，刻度数为 4 r + s + 3 {\displaystyle 4r+s+3} 。需要注意的是，并非所有 威希曼尺都是最优稀疏尺，且并非所有最优稀疏尺都可以通过这种方式得到。长度为 1、13、17、23 和 58 的最优稀疏尺均不符合该形式。如果 Peter Luschny 的最优尺猜想为真，则最长的不符合该形式的最优稀疏尺长度为58。目前为止，该猜想在长度为 213以下均被验证为真。 已隱藏部分未翻譯内容，歡迎參與翻譯。 For every n {\displaystyle n} let l ( n ) {\displaystyle l(n)} be the smallest number of marks for a ruler of length n {\displaystyle n} . For example, l ( 6 ) = 4 {\displaystyle l(6)=4} . The asymptotic of the function l ( n ) {\displaystyle l(n)} was studied by Erdos, Gal (1948) and continued by Leech (1956) who proved that the limit lim n → ∞ l ( n ) 2 / n {\displaystyle \lim _{n\to \infty }{l(n)^{2}}/n} exists and is lower and upper bounded by 2 + 4 3 π = 2.424... < 2.434... = max 0 < θ < 2 π 2 ( 1 − sin ⁡ ( θ ) θ ) ≤ lim n → ∞ l ( n ) 2 n ≤ 375 112 = 3.348... {\displaystyle 2+{\tfrac {4}{3\pi }}=2.424...<2.434...=\max _{0<\theta <2\pi }2(1-{\tfrac {\sin(\theta )}{\theta }})\leq \lim _{n\to \infty }{\frac {l(n)^{2}}{n}}\leq {\frac {375}{112}}=3.348...} Much better upper bounds exist for n {\displaystyle n} -perfect rulers. Those are subsets A {\displaystyle A} of N {\displaystyle \mathbb {N} } such that each positive number k ≤ n {\displaystyle k\leq n} can be written as a difference k = a − b {\displaystyle k=a-b} for some a , b ∈ A {\displaystyle a,b\in A} . For every number n {\displaystyle n} let k ( n ) {\displaystyle k(n)} be the smallest cardinality of an n {\displaystyle n} -perfect ruler. It is clear that k ( n ) ≤ l ( n ) {\displaystyle k(n)\leq l(n)} . The asymptotics of the sequence k ( n ) {\displaystyle 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 0 < θ < 2 π 2 ( 1 − sin ⁡ ( θ ) θ ) ≤ lim n → ∞ k ( n ) 2 n = inf n ∈ N k ( n ) 2 n ≤ 128 2 6166 = 2.6571... < 8 3 . {\displaystyle \max _{0<\theta <2\pi }2(1-{\tfrac {\sin(\theta )}{\theta }})\leq \lim _{n\to \infty }{\frac {k(n)^{2}}{n}}=\inf _{n\in \mathbb {N} }{\frac {k(n)^{2}}{n}}\leq {\frac {128^{2}}{6166}}=2.6571...<{\frac {8}{3}}.} Define the excess as E ( n ) = l ( n ) − ⌈ 3 n + 9 4 ⌋ {\displaystyle E(n)=l(n)-\lceil {\sqrt {3n+{\tfrac {9}{4}}}}\rfloor } . In 2020, Pegg proved by construction that E ( n ) {\displaystyle E(n)} ≤ 1 for all lengths n {\displaystyle n} . If the Optimal Ruler Conjecture is true, then E ( n ) = 0 | 1 {\displaystyle E(n)=0|1} for all n {\displaystyle n} , leading to the ″dark mills″ pattern when arranged in columns, OEIS A326499. None of the best known sparse rulers n > 213 {\displaystyle n>213} are proven minimal as of Sep 2020. Many of the current best known E = 1 {\displaystyle E=1} constructions for n > 213 {\displaystyle n>213} are believed to non-minimal, especially the "cloud" values. Fig 1. Light numbers +0, dark numbers +1 for the minimal mark excess pattern in a sparse ruler. All minimal values to length 213 are proven. Fig 2. "Dark mills on a cloudy day" -- N. J. A. Sloane. Excess pattern for sparse rulers, best known values for L>213. 以下是一些最小稀疏尺的例子。高亮标出了最优尺。如果要列出的内容太多，则不会全部包含在内。不包括镜像。 有些非完全尺可以完全测量比具有相同标记数量的最优稀疏尺更长的距离。 { 0 , 2 , 7 , 14 , 15 , 18 , 24 } {\displaystyle \{0,2,7,14,15,18,24\}} , { 0 , 2 , 7 , 13 , 16 , 17 , 25 } {\displaystyle \{0,2,7,13,16,17,25\}} , { 0 , 5 , 7 , 13 , 16 , 17 , 31 } {\displaystyle \{0,5,7,13,16,17,31\}} ， 和 { 0 , 6 , 10 , 15 , 17 , 18 , 31 } {\displaystyle \{0,6,10,15,17,18,31\}} ，这些非完全尺最多可以测量 18 个不同的长度，但 7 个刻度的最优稀疏尺最多只能测量 17 个不同长度。 下表列出了一些非完全尺，最多有 13 个刻度。不包括镜像。能够测量的不同长度数量比最优稀疏尺还要多的非完全尺被高亮标出。 Robison, A. D. Parallel Computation of Sparse Rulers. Intel Developer Zone. https://web.archive.org/web/20210330141047/https://software.intel.com/content/www/us/en/develop/articles/parallel-computation-of-sparse-rulers.html Erdös, P.; Gál, I. S. On the representation of 1 , 2 , ⋯ , N {\displaystyle 1,2,\cdots ,N} by differences. Nederl. Akad. Wetensch., Proc. 51 (1948) 1155--1158 = Indagationes Math. 10, 379--382 (1949) Leech, John. On the representation of 1 , 2 , ⋯ , n {\displaystyle 1,2,\cdots ,n} by differences. J. London Math. Soc. 31 (1956), 160--169 Redei, L.; Ren′i, A. On the representation of the numbers 1 , 2 , ⋯ , N {\displaystyle 1,2,\cdots ,N} by means of differences. (Russian) Mat. Sbornik N.S. 24(66), (1949). 385--389. Golay, Marcel J. E. Notes on the representation of 1 , 2 , … , n {\displaystyle 1,\,2,\,\ldots ,\,n} by differences. J. London Math. Soc. (2) 4 (1972), 729--734. 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/ （页面存档备份，存于互联网档案馆） Sloane, N.J.A. (编). Sequence A326499. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.