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 and be integers, and suppose that are integer sets of size at least , none of which is contained in an arithmetic progression with difference greater than 1. If , then the sumset contains a block of consecutive integers of length .
Recommendations
Cites work
Cited in
(8)- Blocks of consecutive integers in sumsets (A + B)t
- Long Arithmetic Progressions in Small Sumsets
- Blocks and progressions in subset sum sets
- A proof of a conjecture of Lev
- Consecutive Integers with Close Kernels
- Addendum to: ``Blocks of consecutive integers in sumsets \((A+B)_t\)
- On Highly Composite Consecutive Integers
- Sufficient conditions for perfect mixed tilings
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)