Displaying similar documents to “Discrepancy of cartesian products of arithmetic progressions.”

On non-intersecting arithmetic progressions

Régis de la Bretèche, Kevin Ford, Joseph Vandehey (2013)

Acta Arithmetica

Similarity:

We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than x. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about Δ-systems (also known as sunflowers).