Geometry of the Kronecker sequence (Q1382625)

Let \(\theta\) be an element of the \(d\)-dimensional torus \(T^d\) and \(\tau\) the translation \(\tau(x)= x+\theta\). In the one-dimensional case \textit{V. T. Sós} [Acta Math. Acad. Sci. Hung. 8, 461-472 (1957; Zbl 0080.03503)] proved that for any positive integer \(n\) the set \(\{m\theta: 0\leq m\leq n\}\) forms a partition of \(T^1\) into \(n+1\) intervals, the lengths of which only attain three different values. In the present paper the existence of similar partitions are obtained in arbitrary dimensions. The partitions consist of certain convex polytopes. This extends the two-dimensional results of the present author [\textit{N. Chevallier}, Acta Arith. 98, 19-35 (1996; Zbl 0863.11043)]. In a final section the author proves the lower bound \(J_N(\theta)\geq c\cdot N^{1-{1 \over d}}\) for the isotropic discrepancy \(J_N\) of the Kronecker sequence \((\{\theta m\}^Nm)=1\). This shows that \textit{G. Larcher}'s upper bound [J. Number Theory 31, 367-372 (1989; Zbl 0671.10047)] for badly approximable \(\theta\) is best possible.