Affiliation:
1. Ruhr West University of Applied Sciences , Moscow , Russia
Abstract
Abstract
Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum metric. It was proved that a generic multi-dimensional Kronecker attains the maximal possible number of different gap lengths for every sub-exponential subsequence. We mirror this result in dimension d ∈ {2, 3} by constructing Kronecker sequences which have a surprisingly low number of different nearest neighbor distances for infinitely N ∈ ℕ. Our proof relies on simple arguments from the theory of continued fractions.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. Bach E., Shallit J., Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing), MIT Press, 1996.
2. Biringer I., Schmidt B., “The three gap theorem and Riemannian geometry”, Geom. Dedicata, 136 (2008), 175-190.
3. Eppstein D., Paterson M. and Yao F., “On nearest-neighbor graphs”, Discrete Comput Geom, 17 (1997), 263-282.
4. Haynes A., Marklof J., “A five distance theorem for Kronecker sequences”, 2020, arXiv: 2009.08444.
5. Haynes A., Ramirez J., “Higher dimensional gap theorems for the maximum metric”, Int. J. Number Theory, 2020.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Kronecker Sequences with Many Distances;Experimental Mathematics;2024-04-14