On the discrepancy of convex plane sets (Q1097306): Difference between revisions

Given any integer \(N=2\), we construct an \(N\)-element subset \(P_1, P_2,\dots, P_N\) of the unit square which is uniformly distributed relative to the family of all convex sets in the following quantitative sense. Given any convex subset \(A\) of the unit square, let \(Z(A)\) denote the number of points \(P_i\) in \(A\). We then have the following result concerning the discrepancy: \[ | Z(A)-N \cdot\, \text{area}(A)| < \text{const} \cdot N^{1/3} (\log N)^ 4 \] uniformly for all convex subsets \(A\). This upper bound result completes the lower bound theorem, due to \textit{W. M. Schmidt} [Acta. Arith. 27, 385--396 (1975; Zbl 0274.10038)], which guarantees the existence of a convex subset of discrepancy greater than \(\text{const}\,\cdot N^{1/3}\).