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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.