Kronecker Sequences with Many Distances (Q6972459)

Consider the sequence \((n\alpha)_{n=1}^N \in\mathbb{T}^d\). For any point of this sequence consider its \(L_p\)-distance to nearest neighbor. Let \(\overline{g}_d^p\) be a maximum number of such distances there maximum is taken over all \(\alpha\in\mathbb{T}^d\) and all \(N\).\N\NThe main results of the paper are new lower estimates for \(\overline{g}_d^p\), mainly for small \(d\) and \(p\in\{2,\infty\}\). The proofs are based on extremely nontrivial author's numerical computations combining with the previous result of \textit{A. Haynes} and \textit{J. Marklof} [Int. Math. Res. Not. 2022, No. 24, 19747--19789 (2022; Zbl 1511.11067)] that allows to obtain general lower estimates from numerical results.