Abstract
In this chapter, we finally begin with the mathematically most fascinating results in geometric discrepancy theory: the lower bounds (we have already seen some lower bounds in Chapter 4 but not in a geometric setting). So far we have not answered the basic question, Problem 1.1, namely whether the discrepancy for axis-parallel rectangles must grow to infinity as n n → ∞. An answer is given in Section 6.1, where we prove that D(n,R 2) is at least of the order \(\sqrt {\log n}\). Note that, in order to establish a such a result, we have to show that for any n-point set P in the unit square, some axis-parallel rectangle exists with a suitably high discrepancy. So we have to take into account all possible sets P simultaneously, although we have no idea what they can look like. The proof is a two-page gem due to Roth, based on a cleverly constructed system of orthogonal functions on the unit square. In dimension d, the same method gives D(n,R d ) = 52((log n)(d-1)/2)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Matoušek, J. (1999). Lower Bounds. In: Geometric Discrepancy. Algorithms and Combinatorics, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03942-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-03942-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03941-6
Online ISBN: 978-3-642-03942-3
eBook Packages: Springer Book Archive