Integer Sets Containing No Arithmetic Progressions

DOI10.1112/jlms/s2-35.3.385zbMath0589.10062WikidataQ56341562 ScholiaQ56341562MaRDI QIDQ3717154

D. R. Heath-Brown

Publication date: 1987

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-35.3.385

zbMATH Keywords

large sieve; arithmetic progressions; Hardy-Littlewood circle method; Szemeredi theorem

Mathematics Subject Classification ID

11P55: Applications of the Hardy-Littlewood method

11B25: Arithmetic progressions

11N35: Sieves

Related Items

A proof of two Erdös conjectures on restricted addition and further results, From harmonic analysis to arithmetic combinatorics, A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II, An upper bound for the \(k\)-barycentric Davenport constant of groups of prime order, Finding large 3-free sets. I. The small \(n\) case, Roth's theorem on progressions revisited, On distinct distances and \(\lambda \)-free point sets, Polynomial configurations in difference sets, A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression, Subset sums, Arithmetical progressions and the number of sums, Greedy algorithm, arithmetic progressions, subset sums and divisibility, Progression-free sets in finite abelian groups., On subsets of finite Abelian groups with no 3-term arithmetic progressions, Erdős and the integers, Integer sets containing no arithmetic progressions, A new proof of Roth’s theorem on arithmetic progressions