A metric discrepancy result for the Hardy-Littlewood-Pólya sequences (Q967593): Difference between revisions

The discrepancies \(D_N\) and \(D_N^*\) of sequence \(\{x_k\}\) of real numbers are defined by \[ D_N\{x_k\}=\sup_{0\leq a'<a<1}\left|\frac{1}{N}\sum_{k=1}^Nf_{a',a}(x_k)\right|,\quad D_N^*\{x_k\}=\sup_{0\leq a<1}\left|\frac{1}{N}\sum_{k=1}^Nf_{0,a}(x_k)\right|, \] where \(f_{a',a}(x)=\mathbf{1}_{[a',a)}(\langle x\rangle)-(a-a')\), \(\mathbf{1}_{[a',a)}\) denotes the indicator function of \([a',a)\), and \(\langle x\rangle\) denotes the fractional part \(x-[x]\) of the real number \(x\). On the other hand, the Hardy-Littlewood-Pólya sequences \(\{n_k\}\) are defined as follows: Take a finite sequence \(q_1,\dots, q_{\tau}\) of coprime positive integers and let \(\{n_k\}\) be an arrangement in increasing order of \[ \{q_1^{i_1}\dots q_{\tau}^{i_{\tau}}\mid i_1,\dots,i_{\tau}\in \mathbb{N}_0\}, \] where \(\mathbb{N}_0=\{0,1,2,\dots\}.\) The paper under review proves the exact law of the iterated logarithm for discrepancies of the Hardy-Littlewood-Pólya sequences. The exact constant in the law of the iterated logarithm is explicitly computed in the case when the Hardy-Littlewood-Pólya sequence consists of odd numbers.