Discrepancy of arithmetic progressions in grids
From MaRDI portal
(Redirected from Publication:6144282)
Abstract: We prove that the the discrepancy of arithmetic progressions in the -dimensional grid is within a constant factor depending only on of . This extends the case , which is a celebrated result of Roth and of Matouv{s}ek and Spencer, and removes the polylogarithmic factor from the previous upper bound of Valk'o from about two decades ago. We further prove similarly tight bounds for grids of differing side lengths in many cases.
Recommendations
Cites work
- An introduction to the geometry of numbers.
- Constructive discrepancy minimization by walking on the edges
- Discrepancy in arithmetic progressions
- Discrepancy of arithmetic progressions in higher dimensions
- Discrepancy of cartesian products of arithmetic progressions
- Factoring polynomials with rational coefficients
- Geometric discrepancy. An illustrated guide
- Remark concerning integer sequences
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- The probabilistic method
This page was built for publication: Discrepancy of arithmetic progressions in grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144282)