A LeVeque-type lower bound for discrepancy
Using Fourier methods, the author proves that if \(Q\) is any probability measure on \(\mathbb{R}/ \mathbb{Z}\), then the discrepancy of \(Q\) satisfies: \[ D(Q)\geq \left({2\over \pi^2}\sum^\infty_{m=1} {\bigl|\widehat Q(m)\bigr |^2 \over m^2} \right)^{1/2}, \] where \(\widehat Q(m)\) is the \(m\)-th Fourier coefficient of \(Q\). This bound is sharp, and the constant \(2/\pi^2\) is best possible. This result is similar to the upper bound due to \textit{W. J. LeVeque} [Proc. Sympos. Pure Math. 8, 22-30 (1965; Zbl 0136.33901)]. An analogous bound is also given for the discrepancy on \(\mathbb{R}^k/ \mathbb{Z}^k\) \((k\geq 1)\). Furthermore, applications of these results to Kronecker sequences and a random walk on the torus are given. For the entire collection see [Zbl 0924.00041].
- On the distribution of Jacobi sums
- Approximating probability measures on manifolds via radial basis functions
- scientific article; zbMATH DE number 822312 (Why is no real title available?)
- The determinant bound for discrepancy is almost tight
- On the Wasserstein distance between classical sequences and the Lebesgue measure
- The rival coffee shop problem
- LeVeque type inequalities and discrepancy estimates for minimal energy configurations on spheres
This page was built for publication: A LeVeque-type lower bound for discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934395)
