Abstract.
A method of proof is given for obtaining lower bounds on strip discrepancy when the distributions do not have atoms. Partition the unit square into an chessboard of congruent square pixels, where n is even. Color of the pixels red, and the rest blue. For any convex set A, let be the difference between the amounts of red and blue areas in A. Under a technical local balance condition, we prove there must be a strip S, of width less than , for which , where c is a positive constant, independent of n and the coloring. The proof extends methods discovered by Alexander and further developed by Chazelle, Matoušek, and Sharir. Integral geometric notions figure prominently.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
(Received 21 September 1998; in final form 21 February 2000)
Rights and permissions
About this article
Cite this article
Rogers, A. Lower Bounds on Strip Discrepancy for Nonatomic Colorings. Mh Math 130, 311–328 (2000). https://doi.org/10.1007/s006050070030
Issue Date:
DOI: https://doi.org/10.1007/s006050070030