论文信息 - Discrepancy of arithmetic progressions in grids

Discrepancy of arithmetic progressions in grids

We prove that the the discrepancy of arithmetic progressions in the d-dimensional grid {1, . . . , N} is within a constant factor depending only on d of N d 2d+2 . This extends the case d = 1, which is a celebrated result of Roth and of Matoušek and Spencer, and removes the polylogarithmic factor from the previous upper bound of Valkó from about two decades ago. We further prove similarly tight bounds for grids of differing side lengths in many cases.

[1] William W. L. Chen. On irregularities of distribution. , 1980 .

[2] J. Matousek,et al. Geometric Discrepancy: An Illustrated Guide , 2009 .

[3] K. F. Roth. Remark concerning integer sequences , 1964 .

[4] C. A. Rogers,et al. An Introduction to the Geometry of Numbers , 1959 .

[5] József Beck,et al. Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[6] Anand Srivastav,et al. Discrepancy of Cartesian Products of Arithmetic Progressions , 2004, Electron. J. Comb..

[7] B. Valkó. Discrepancy of Arithmetic Progressions in Higher Dimensions , 2002 .

[8] Jiří Matoušek,et al. Discrepancy in arithmetic progressions , 1996 .

[9] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[10] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.