Multi-dimensional Kronecker sequences with a small number of gap lengths

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 i n l e f t 2, 3 i g h t

by constructing Kronecker sequences which have a surprisingly low number of different nearest neighbor distances for infinitely

N i n m a t h b b N

. Our proof relies on simple arguments from the theory of continued fractions.

Review text

In [\textit{A. Haynes} and \textit{J. Marklof}, ``A five distance theorem for Kronecker sequences, Preprint, \url{arXiv:2009.08444}], a natural generalization of the Three Gap Theorem to the higher dimensional Kronecker sequence is considered. It is proved that a generic multi-dimensional Kronecker attains the maximal possible number of different gap lengths for every sub-exponential subsequence. In this paper, in order to do one specific type of generalization of Three Gap Theorem, multi-dimensional Kronecker sequences are considered in dimension \(d\in\{2,3\}\), which have a surprisingly small number of nearest neighbor distances for infinitely many \(N\in\mathbb N\). The construction is simple and relies on the continued fraction expansion.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Multi-dimensional Kronecker sequences with a small number of gap lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136303)