English

Long Arithmetic Progressions in Sets with Small Sumset

Number Theory 2009-04-23 v1 Combinatorics

Abstract

Let A,BZA, B\subseteq \mathbb{Z} be finite, nonempty subsets with minA=minB=0\min A=\min B=0, and let \delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If maxBmaxAA+B3\max B\leq \max A\leq |A|+|B|-3 and \label{one}|A+B|\leq |A|+2|B|-3-\delta(A,B), then we show A+BA+B contains an arithmetic progression with difference 1 and length A+B1|A|+|B|-1. As a corollary, if \eqref{one} holds, max(B)max(A)\max(B)\leq \max(A) and either gcd(A)=1\gcd(A)=1 or else gcd(A+B)=1\gcd(A+B)=1 and A+B2A+B3|A+B|\leq 2|A|+|B|-3, then A+BA+B contains an arithmetic progression with difference 1 and length A+B1|A|+|B|-1.

Keywords

Cite

@article{arxiv.0904.3514,
  title  = {Long Arithmetic Progressions in Sets with Small Sumset},
  author = {Itziar Bardaji and David J. Grynkiewicz},
  journal= {arXiv preprint arXiv:0904.3514},
  year   = {2009}
}
R2 v1 2026-06-21T12:54:06.588Z