Lower bounds on strip discrepancy for nonatomic colorings (Q1587355)

The unit square \(U^2= [0,1)^2\) is partitioned into an \(N\times N\) chessboard of \(n=N^2\) congruent square pixels (\(N\) even); \(\frac n2\) of the pixels are colored red, the rest blue. For any convex set \(A\), let \(\mu(A)\) be the difference between the amounts of red and blue areas in \(A\). Under a technical local balance condition, the author proves that there must be a strip \(S\) of width \(<n^{-\frac 12}\), for which \(n|\mu(S) |\geq cn^{1/4}\), where \(c\) is a positive constant independent of \(n\) and the coloring. The proof essentially depends on notions and methods from integral geometry.