Irregularities of Distributions and Extremal Sets in Combinatorial Complexity Theory
In 2004 the second author of the present paper proved that a point set in [0, 1]d which has star-discrepancy at most ε must necessarily consist of at least cabsdε−1 points. Equivalently, every set of n points in [0, 1]d must have star-discrepancy at least cabsdn−1. The original proof of this result uses methods from Vapnik–Chervonenkis theory and from metric entropy theory. In the present paper we give an elementary combinatorial proof for the same result, which is based on identifying a sub-box of [0, 1]d which has approximately d elements of the point set on its boundary. Furthermore, we show that a point set for which no such box exists is rather irregular, and must necessarily have a large star-discrepancy.
The first author is supported by the Austrian Science Fund (FWF), projects F5507-N26 and I1751-N26, and by the FWF START project Y-901-N35.
- 4.Drmota, M., Tichy, R.F.: Sequences, Discrepancies and Applications. Lecture Notes in Mathematics, vol. 1651. Springer, Berlin (1997)Google Scholar
- 8.Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Wiley-Interscience [Wiley], New York, London, Sydney (1974)Google Scholar
- 10.Novak, E., Woźniakowski, H.: Tractability of Multivariate Problems. Vol. 1: Linear Information. EMS Tracts in Mathematics, vol. 6. European Mathematical Society, Zürich (2008)Google Scholar
- 11.Novak, E., Woźniakowski, H.: Tractability of Multivariate Problems. Vol. 2: Standard Information for Functionals. EMS Tracts in Mathematics, vol. 12. European Mathematical Society, Zürich (2010)Google Scholar