The discrepancy of a needle on a checkerboard, II

Details The discrepancy of a needle on a checkerboard, II The discrepancy of a needle on a checkerboard, II

2008-11-18

arxiv.org/abs/0811.3005v1

Mathematics

Classical Analysis and ODEs

9 pages, 3 figures

Scientific paper

Consider the plane as a checkerboard, with each unit square colored black or white in an arbitrary manner. In a previous paper we showed that for any such coloring there are straight line segments, of arbitrarily large length, such that the difference of their white length minus their black length, in absolute value, is at least the square root of their length, up to a multiplicative constant. For the corresponding "finite" problem ($N \times N$ checkerboard) we had proved that we can color it in such a way that the above quantity is at most $C \sqrt{N \log N}$, for any placement of the line segment. In this followup we show that it is possible to color the infinite checkerboard with two colors so that for any line segment $I$ the excess of one color over another is bounded above by $C_\epsilon \Abs{I}^{\frac12+\epsilon}$, for any $\epsilon>0$. We also prove lower bounds for the discrepancy of circular arcs. Finally, we make some observations regarding the $L^p$ discrepancies for segments and arcs, $p<2$, for which our $L^2$-based methods fail to give any reasonable estimates.

Affiliated with

Also associated with

No associations

Rating

The discrepancy of a needle on a checkerboard, II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The discrepancy of a needle on a checkerboard, II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The discrepancy of a needle on a checkerboard, II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-428758