Arithmetic Progressions in Sets with Small Sumsets
From MaRDI portal
Publication:5295404
Abstract: We present an elementary proof that if is a finite set of numbers, and the sumset is small, , along a dense graph , then contains -term arithmetic progressions.
Recommendations
Cited in
(14)- Sequences with small subsum sets
- Large minimal sets which force arithmetic progressions
- Arithmetic progressions in partially ordered sets
- Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
- Arithmetic progressions in sets of small doubling
- Arithmetic Progressions in Sumsets of Sparse Sets
- On \(3\)-term arithmetic progressions in product sets over finite rings via spectra of graphs.
- ARITHMETIC PROGRESSIONS IN SUMSETS AND DIFFERENCE SETS
- Arithmetic progressions in sumsets of sparse sets
- On an almost all version of the Balog-Szemerédi-Gowers theorem
- scientific article; zbMATH DE number 5219605 (Why is no real title available?)
- The counting lemma for regular k‐uniform hypergraphs
- Independent sums of arithmetic progressions in K_m-free graphs.
- Long arithmetic progressions in critical sets
This page was built for publication: Arithmetic Progressions in Sets with Small Sumsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295404)