An elementary proof of a lower bound for the inverse of the star discrepancy (Q2685069)

Let \(N^*_{\infty}(d,\varepsilon)\) is the smallest possible cardinality of a set \(x_1,\ldots,x_n\) in \(\mathbb{R}^d\) with star discrepancy \(D_n^*=\max_{y\in [0;1]^d} \left| \frac{1}{n}\sharp \{ 1\leq i\leq n: x_i\in [0;y] \}-\mathrm{vol}([0;y]) \right|\) less than \(\varepsilon\). In [\textit{A. Hinrichs}, J. Complexity 20, No. 4, 477--483 (2004; Zbl 1234.11101)] it was proved that there are universal \(c,\varepsilon_0>0\) such that for any \(\varepsilon, 0<\varepsilon<\varepsilon_0\) we have \(N^*_{\infty}(d,\varepsilon)\geq c\frac{d}{\varepsilon}\). The paper under review contains a more elementary proof of this result with \(N^*_{\infty}(d,\varepsilon)\geq \frac{d}{2}\left\lfloor \frac{1}{20\varepsilon} \right\rfloor\).