Kronecker Sequences with Many Distances
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.
- A Five Distance Theorem for Kronecker Sequences
- Higher-dimensional gap theorems for the maximum metric
- scientific article; zbMATH DE number 3153217 (Why is no real title available?)
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Mathematics of aperiodic order
- Multi-dimensional Kronecker sequences with a small number of gap lengths
- On successive settings of an arc on the circumference of a circle
- On the theory of diophantine approximations. I1 (on a problem of A. Ostrowski)
- The Closest Packing of Spherical Caps in n Dimensions
- The three gap theorem and Riemannian geometry
This page was built for publication: Kronecker Sequences with Many Distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972459)
