Long arithmetic progressions in sumsets: Thresholds and bounds
From MaRDI portal
Abstract: For a set of integers, the sumset consists of those numbers which can be represented as a sum of elements of lA ={a_1+... a_l| a_i in A_i }. A closely related and equally interesting notion is that of , which is the collection of numbers which can be represented as a sum of different elements of 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 and , where is a subset of . As applications, we solve two conjectures by Erd"os and Folkman, posed in sixties.
Recommendations
Cites work
- A polynomial bound in Freiman's theorem.
- An addition theorem for the elementary abelian group
- Arithmetic progressions in sumsets
- Complete sequences of polynomial values
- Cyclic Spaces for Grassmann Derivatives and Additive Theory
- Finite addition theorems. I
- Finite and infinite arithmetic progressions in sumsets
- Generalized arithmetical progressions and sumsets
- scientific article; zbMATH DE number 4177149 (Why is no real title available?)
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 3501619 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1315256 (Why is no real title available?)
- scientific article; zbMATH DE number 1315258 (Why is no real title available?)
- scientific article; zbMATH DE number 683826 (Why is no real title available?)
- scientific article; zbMATH DE number 863489 (Why is no real title available?)
- scientific article; zbMATH DE number 3345481 (Why is no real title available?)
- Integer Sum Sets Containing Long Arithmetic Progressions
- Long arithmetic progressions in sum-sets and the number x-sum-free sets
- New analytical results in subset-sum problem
- On a conjecture of Erdös and Heilbronn
- On addition of two distinct sets of integers
- On subset sums of a fixed set
- On the maximal density of sum-free sets
- On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence
- On the representation of integers as sums of distinct terms from a fixed set
- On the representation of large integers as sums of distinct summands taken from a fixed set
- Optimal representations by sumsets and subset sums
- The Hardy-Littlewood method.
Cited in
(28)- Classification theorems for sumsets modulo a prime
- Sets with distinct sums of pairs, long arithmetic progressions, and continuous mappings
- Approximate arithmetic structure in large sets of integers
- On Hilbert cubes and primitive roots in finite fields
- Long regularly-spaced and convex sequences in dense sets of integers
- Monochromatic Hilbert cubes and arithmetic progressions
- Finite and infinite arithmetic progressions in sumsets
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A sharp inverse Littlewood-Offord theorem
- A Structural Approach to Subset-Sum Problems
- On the maximal length of arithmetic progressions
- A new approach to an old problem of Erdős and Moser
- Long arithmetic progressions in sum-sets and the number x-sum-free sets
- The structure theory of set addition revisited
- A proof of a conjecture of Lev
- Structural approach to subset sum problems
- Inverse Littlewood-Offord problems for quasi-norms
- Near optimal bounds in Freiman's theorem
- Erdős and arithmetic progressions
- The upper logarithmic density of monochromatic subset sums
- On classification of sequences containing arbitrarily long arithmetic progressions
- Consecutive integers in high-multiplicity sumsets
- Optimal inverse Littlewood-Offord theorems
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- A generalization of sumsets of set of integers
- Long arithmetic progressions in critical sets
- On a conjecture of Alon
- John-type theorems for generalized arithmetic progressions and iterated sumsets
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)