On the union of arithmetic progressions

DOI10.1137/130941122MaRDI QIDQ2935258zbMATH OpenOpenAlexFDO

Authors Shoni Gilboa, Rom Pinchasi

Publication date 22 December 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.4348

zbMATH Keywords

arithmetic progressionsadditive combinatoricsBondy-Simonovits theorem

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Extremal combinatorics (05D99)

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(n^2)$. We refer also to the non-symmetric case of $n$ arithmetic progressions, each of length $ell$, for various regimes of $n$ and $ell$.

Recommendations

• Arithmetical progressions and the number of sums
• Integer Sum Sets Containing Long Arithmetic Progressions
• On disjoint arithmetic progressions
• scientific article; zbMATH DE number 5181747
• Arithmetic progressions in sumsets

Cited in

(4)

• Covering an arithmetic progression with geometric progressions and vice versa
• On disjoint arithmetic progressions
• Functions tiling with several lattices
• An intersection-union theorem for integer sequences

This page was built for publication: On the union of arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935258)