English

Nine-distance theorem and growth of best-approximation denominators

Number Theory 2026-08-02 v1 Combinatorics

Abstract

We prove a nine-distance theorem for Kronecker sequences on flat three-tori. That is, we show that among the first NN orbit points, at most nine distinct positive nearest-neighbour distances occur. This proves the conjecture of Haynes and Marklof. An example of Dettmann shows that nine is optimal. More generally, we prove that on a flat dd-dimensional torus the number of such distances is at most 2d+12^d+1. The main tool is a new growth theorem for the denominators q1<q2<q_1<q_2<\cdots of best simultaneous approximations in a dd-dimensional inner-product space, which is of independent interest. We prove that, whenever qn+2dq_{n+2^d} is defined, either qn+2d2qn+1q_{n+2^d}\ge2q_{n+1}, or the indices 1,,2d1,\ldots,2^d can be partitioned into disjoint pairs {j,k}\{j,k\}, j<kj<k, such that qn+k=qn+qn+jq_{n+k}=q_n+q_{n+j}. In particular, qn+2dmin{2qn+1,qn+qn+2d1}qn+qn+1. q_{n+2^d}\ge \min\{2q_{n+1},q_n+q_{n+2^{d-1}}\}\ge q_n+q_{n+1}.

Keywords

Cite

@article{arxiv.2608.01443,
  title  = {Nine-distance theorem and growth of best-approximation denominators},
  author = {Nikita Shulga},
  journal= {arXiv preprint arXiv:2608.01443},
  year   = {2026}
}

Comments

15 pages