Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration
Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration
Fibonacci sets and symmetrization in discrepancy theory
Journal of Complexity
| Hi-index | 0.00 |
The L"2-discrepancy measures the irregularity of the distribution of a finite point set. In this note, we prove lower bounds for the L"2-discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper and lower estimates of the L"2-discrepancy in dimension 2 are well known, and are of the sharp order logN. Nevertheless, the gap in the constants between the best-known lower and upper bounds is unsatisfactorily large for a two-dimensional problem. Our lower bound improves upon this situation considerably. The main method is an adaption of Roth's method, using the Fourier coefficients of the discrepancy function with respect to the Haar basis. We obtain the same improvement in the quotient of lower and upper bounds in the general d-dimensional case. Our lower bounds are also valid for the weighted discrepancy.