Abstract
For eachd≥2, it is possible to placen points ind-space so that, given any two-coloring of the points, a half-space exists within which one color outnumbers the other by as much ascn 1/2−1/2d, for some constantc>0 depending ond. This result was proven in a slightly weaker form by Beck and the bound was later tightened by Alexander. It was recently shown to be asymptotically optimal by Matoušek. We present a proof of the lower bound, which is based on Alexander's technique but is technically simpler and more accessible. We present three variants of the proof, for three diffrent cases, to provide more intuitive insight into the “large-discrepancy” phenomenon. We also give geometric and probabilistic interpretations of the technique.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alexander, R. Geometric methods in the study of irregularities of distribution.Combinatorica 10 (1990), 115–136.
Alexander, R.. Principles of a new method in the study of irregularities of distribution,Invent. Math. 103 (1991) 279–296.
Beck, J. Quasi-random 2-colorings of point sets,Random Struct. Algorithms 2 (1991) 289–302.
Beck, J., Chen, W. W. L.Irregularities of Distribution, Cambridge Tracts in Mathematics, Vol. 89, Cambridge University Press, Cambridge, 1987.
Beck, J., Sós, V. T. Discrepancy theory, inHandbook of Combinatorics, to appear.
Buffon, G. Essai d'arithmétique morale,Suppl. Hist. Natur.,4, (1777).
Burden, R. L., Faires, J. D., Reynolds, A. C.Numerical Analysis, PWS-KENT, 1989.
Matoušek, J. Tight upper bounds for the discrepancy of half-spaces KAM Series (Tech. Report), Charles University, Praka, 1994; submitted toDiscrete Comput. Geom.
Matoušek, J., Welzl, E., Wernisch, L. Discrepancy and ∈-approximations for boundedVC-dimension.Combinatorica 13 (1993), 455–466.
Roth, K. F. Remark concerning integer sequences,Acta Arith. 9 (1964), 257–260.
Santaló, L. A.Integral Geometry and Geometric Probability, Encyclopedia of Mathematics and Its Applications, Vol. 1, Addison-Wesley, Rading, MA, 1976.
Author information
Authors and Affiliations
Additional information
Work by Bernard Chazelle has been supported in part by NSF Grant CCR-90-02352 and The Geometry Center, University of Minnesota, an STC funded by NSF, DOE, and Minnesota Technology, Inc. Work by Jiří Matoušek has been supported by Charles University Grant No. 351, by Czech Republic Grant GAČR 201/93/2167 and in part by DIMACS. Work by Micha Sharir has been supported by NSF Grant CCR-91-22103, by a Max-Planck Research Award, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.
Rights and permissions
About this article
Cite this article
Chazelle, B., Matoušek, J. & Sharir, M. An elementary approach to lower bounds in geometric discrepancy. Discrete Comput Geom 13, 363–381 (1995). https://doi.org/10.1007/BF02574050
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574050