On the discrepancy of \((0,1)\)-sequences. (Q1427986): Difference between revisions

For the \(L^ p\)-discrepancy \(L^ p_N={1\over N}(\int_0^1| \Delta_N(\alpha)| ^p\,d\alpha)^{1/p}\) (\(\Delta_N\) denoting the classical discrepancy function of the first \(N\) elements) of the van der Corput sequence of base 2, \(p\in \mathbb N\), the upper bound \[ (NL^p_N)^p\leq\left({\log N\over 6\log 2} \right)^p+O((\log N)^{p-1}) \] and the limit \(\limsup_{N\to\infty}L^p_N/\log N=1/(6\log 2)\) is obtained. This extends results of \textit{H. Fauré} [Acta Arith. 55, No. 4, 333--350 (1990; Zbl 0705.11039)] and \textit{S. Haber} [J. Res. Natl. Bur. Stand., Sect. B 70, 127--136 (1966; Zbl 0158.16002)] for \(p=2\). Digital \((0,1)\)-sequences are generalisations of the van der Corput sequence of base 2. The best upper bound for the *-discrepancy of the van der Corput sequence is shown to be an upper bound for any digital \((0,1)\)-sequence. An example of a digital \((0,1)\)-sequence with strictly smaller *-discrepancy is given.