On an algorithm for constructing uniformly distributed Korobov grids (Q369595): Difference between revisions

In the paper under review, the authors deal with the problem of effectively compute uniformly distributed grids of the multidimensional unit cube. They consider the so-called Korobov grids; these grids depend on \(s+1\) positive integers \(p,a_1,\dots,a_s\) and are defined as \[ \xi_{k}^{(p)} (a_1,\dots,a_s) = \left(\left\{\frac{k}{p}a_1\right\},\dots,\left\{\frac{k}{p}a_s\right\}\right),\quad k=1,\dots,p, \] where \(\{x\}\) denotes the fractional part of \(x\). \textit{N. M. Korobov} [Number-theoretic methods in approximate analysis (Russian). Moskva: Gosudarstv. Izdat. Fiz.-Mat. Lit. (1963; Zbl 0115.11703)] proved that, for any \(p\), there exist \(a_1,\dots,a_s\) such that the grid \(\xi_{k}^{(p)} (a_1,\dots,a_s)_{k=1}^p\) is uniformly distributed in \([0,1]^s\). In the paper, the authors state a theorem useful to detect such sequences of integers.