Long arithmetic progressions in sumsets: Thresholds and bounds

From MaRDI portal



Abstract: For a set A of integers, the sumset lA=A+...+A consists of those numbers which can be represented as a sum of l elements of A lA ={a_1+... a_l| a_i in A_i }. A closely related and equally interesting notion is that of lastA, which is the collection of numbers which can be represented as a sum of l different elements of A l^{ast} A ={a_1+... a_l| a_i in A_i, a_i eq a_j }. The goal of this paper is to investigate the structure of lA and lastA, where A is a subset of 1,2,...,n. As applications, we solve two conjectures by Erd"os and Folkman, posed in sixties.




Cites work


Cited in
(28)








This page was built for publication: Long arithmetic progressions in sumsets: Thresholds and bounds

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