arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.08444math.NTmath.DS
收藏

Kronecker序列的一个五距离定理

A five distance theorem for Kronecker sequences

Alan Haynes, Jens Marklof

摘要:

三距离定理(也称为三间隙定理或斯坦豪斯问题)指出,对于任何给定的实数$α$和整数$N$,克罗内克序列$α, 2α,\ldots, Nα$ mod 1的连续元素之间的距离最多有三个值。在本文中,我们考虑一个自然的推广的三个距离定理的高维Kronecker序列$\vecα, 2\vecα,\ldots, N\vecα$模一个整数格。我们证明,在两个维度上最多有五个值,可以出现最近的邻居之间的距离,所有的选择$\vecα$和$N$。此外,对于几乎每一个$\vecα$,对于无穷多个$N$确实出现五个不同的距离,因此五是最佳可能的一般上界。在更高的维度中,我们有类似的明确的,但不太精确的上界。例如,在三维空间中,我们的界限是13,尽管我们推测真理是9。我们还研究了在有限方向锥中从一点到其最近邻点的可能距离的数目。这可以被视为在一个维度上的间隙长度的概括。对于大锥角,我们使用几何参数直接类似于三距离定理产生明确的界限。对于小锥角,我们使用遍历论的均匀流在幺模格的空间中,以显示不同的长度的数量是(a)无界的几乎所有的$\vecα$和(b)有界的$\vecα$,满足一定的丢番图条件。

英文摘要:

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $α$ and integer $N$, there are at most three values for the distances between consecutive elements of the Kronecker sequence $α, 2α,\ldots, Nα$ mod 1. In this paper we consider a natural generalisation of the three distance theorem to the higher dimensional Kronecker sequence $\vecα, 2\vecα,\ldots, N\vecα$ modulo an integer lattice. We prove that in two dimensions there are at most five values that can arise as a distance between nearest neighbors, for all choices of $\vecα$ and $N$. Furthermore, for almost every $\vecα$, five distinct distances indeed appear for infinitely many $N$ and hence five is the best possible general upper bound. In higher dimensions we have similar explicit, but less precise, upper bounds. For instance in three dimensions our bound is 13, though we conjecture the truth to be 9. We furthermore study the number of possible distances from a point to its nearest neighbor in a restricted cone of directions. This may be viewed as a generalisation of the gap length in one dimension. For large cone angles we use geometric arguments to produce explicit bounds directly analogous to the three distance theorem. For small cone angles we use ergodic theory of homogeneous flows in the space of unimodular lattices to show that the number of distinct lengths is (a) unbounded for almost all $\vecα$ and (b) bounded for $\vecα$ that satisfy certain Diophantine conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑