2000 character limit reached
On the Union of Arithmetic Progressions
Published 16 Oct 2013 in math.CO | (1310.4348v1)
Abstract: We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at least $c(\varepsilon)n{2-\varepsilon}$ elements. We observe, by construction, that one can find $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences such that the cardinality of their union is $o(n2)$. We refer also to the non-symmetric case of $n$ arithmetic progressions, each of length $\ell$, for various regimes of $n$ and $\ell$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.