Consecutive integers in high-multiplicity sumsets

From MaRDI portal
(Redirected from Publication:626032)



Abstract: Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset to contain a block of consecutive integers of length, comparable with the lengths of the set summands. A corollary of our main result is as follows. Let k,lge1 and nge3 be integers, and suppose that A1,...,Aksubset[0,l] are integer sets of size at least n, none of which is contained in an arithmetic progression with difference greater than 1. If kge2lceil(l−1)/(n−2)ceil, then the sumset A1+...+Ak contains a block of consecutive integers of length k(n−1).












This page was built for publication: Consecutive integers in high-multiplicity sumsets

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