On the discrepancy of sequences in the unit-interval (Q266166)

Let \(\omega=(x_1, x_2, x_3,\dots)\) be a sequence in the unit-interval. The extreme discrepancy is NEWLINE\[NEWLINE D_N(\omega)=\sup_{0\leq \alpha<\beta\leq 1}\left|\frac{A_N([\alpha, \beta))}{N}-(\beta-\alpha)\right|,NEWLINE\]NEWLINE where \(A_N([\alpha,\beta))=\#\{1\leq n\leq N\;|\;x_n\in[\alpha,\beta)\}\). It was shown by \textit{W. M. Schmidt} [Acta Arith. 21, 45--50 (1972; Zbl 0244.10035)] that there exists a constant \(c>0\) such that for every sequence \(\omega\) NEWLINE\[NEWLINE D_N(\omega)\geq c\cdot \frac{\log N}{N}NEWLINE\]NEWLINE for infinitely many \(N\). The discrepancy constant is defined NEWLINE\[NEWLINE c_{\infty}=\inf_{\omega}\limsup_{N\to\infty}\frac{ND_N(\omega)}{\log N}.NEWLINE\]NEWLINE The exact value of \(c_{\infty}\) is not known. \textit{R. Béjian} [Acta Arith. 41, 185--202 (1982; Zbl 0439.10038)] showed a lower bound \(0.1203\dots<c_{\infty}(\omega)\). In this paper, the author improves the lower bound to \(0.121128\dots\).