English

On the Union of Arithmetic Progressions

Combinatorics 2017-05-15 v1

Abstract

We show that for every ε>0\varepsilon>0 there is an absolute constant c(ε)>0c(\varepsilon)>0 such that the following is true. The union of any nn arithmetic progressions, each of length nn, with pairwise distinct differences must consist of at least c(ε)n2εc(\varepsilon)n^{2-\varepsilon} elements. We observe, by construction, that one can find nn arithmetic progressions, each of length nn, with pairwise distinct differences such that the cardinality of their union is o(n2)o(n^2). We refer also to the non-symmetric case of nn arithmetic progressions, each of length \ell, for various regimes of nn and \ell.

Keywords

Cite

@article{arxiv.1310.4348,
  title  = {On the Union of Arithmetic Progressions},
  author = {Shoni Gilboa and Rom Pinchasi},
  journal= {arXiv preprint arXiv:1310.4348},
  year   = {2017}
}
R2 v1 2026-06-22T01:48:06.041Z