Arithmetic Progressions in Sumsets of Sparse Sets

Authors

Abstract: A set of positive integers

A s u b s e t m a t h b b Z_{> 0}

is emph{log-sparse} if there is an absolute constant

C

so that for any positive integer

x

the sequence contains at most

C

elements in the interval

[x, 2 x)

. In this note we study arithmetic progressions in sums of log-sparse subsets of

m a t h b b Z_{> 0}

. We prove that for any log-sparse subsets

S_{1}, d o t s, S_{n}

of

m a t h b b Z_{> 0},

the sumset

S = S_{1} + c d o t s + S_{n}

cannot contain an arithmetic progression of size greater than

n^{(1 + o (1)) n} .

We also show that this is nearly tight by proving that there exist log-sparse sets

S_{1}, d o t s, S_{n}

such that

S_{1} + c d o t s + S_{n}

contains an arithmetic progression of size

n^{(1 - o (1)) n} .

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Arithmetic Progressions in Sumsets of Sparse Sets