The exponent of discrepancy is at most 1.4778...
Open Access
- 1 July 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (219) , 1125-1132
Abstract
We study discrepancy with arbitrary weights in the L 2 L_2 norm over the d d -dimensional unit cube. The exponent p ∗ p^* of discrepancy is defined as the smallest p p for which there exists a positive number K K such that for all d d and all ε ≤ 1 \varepsilon \le 1 there exist K ε − p K\varepsilon ^{-p} points with discrepancy at most ε \varepsilon . It is well known that p ∗ ∈ ( 1 , 2 ] p^*\in (1,2] . We improve the upper bound by showing that \[ p ∗ ≤ 1.4778842. p^*\le 1.4778842. \] This is done by using relations between discrepancy and integration in the average case setting with the Wiener sheet measure. Our proof is not constructive. The known constructive bound on the exponent p ∗ p^* is 2.454 2.454 .Keywords
This publication has 10 references indexed in Scilit:
- Efficient algorithms for computing the 𝐿₂-discrepancyMathematics of Computation, 1996
- Explicit Cost Bounds of Algorithms for Multivariate Tensor Product ProblemsJournal of Complexity, 1995
- Lattice Methods for Multiple Integration1994
- Random Number Generation and Quasi-Monte Carlo Methods1992
- Average case complexity of multivariate integrationBulletin of the American Mathematical Society, 1991
- Irregularities of Distribution1987
- On irregularities of distribution, IVActa Arithmetica, 1980
- Quasi-Monte Carlo methods and pseudo-random numbersBulletin of the American Mathematical Society, 1978
- On irregularities of distributionMathematika, 1954
- On Frobeniusean Algebras. IAnnals of Mathematics, 1939