Integer Sets Containing No Arithmetic Progressions

DOI10.1112/JLMS/S2-35.3.385zbMATH Open0589.10062OpenAlexW2041824078WikidataQ56341562 ScholiaQ56341562MaRDI QIDQ3717154FDOQ3717154

Authors: 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

Recommendations

Integer sets containing no arithmetic progressions
Sets of integers that do not contain long arithmetic progressions
On sets of integers containing k elements in arithmetic progression
scientific article; zbMATH DE number 3523693
On sequences of integers containing no arithmetic progression
Sets of nonnegative integers not containing an arithmetic progression of length 𝑝
On sets of integers containing no four elements in arithmetic progression
scientific article; zbMATH DE number 3169559
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

zbMATH Keywords

arithmetic progressions Hardy-Littlewood circle method large sieve Szemeredi theorem

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Applications of the Hardy-Littlewood method (11P55) Sieves (11N35)

Cited In (68)

On non-intersecting arithmetic progressions
Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
Quantitative bounds in the nonlinear Roth theorem
Title not available (Why is that?)
Tower-type bounds for Roth's theorem with popular differences
Norm estimates for the Kakeya maximal function in high dimensions with respect to general measures
Roth-type theorem for quadratic system in Piatetski-Shapiro primes
Improved bounds for five-term arithmetic progressions
Six Primes and an Almost Prime in Four Linear Equations
Uniform hypergraphs containing no grids
Logarithmic bounds for Roth's theorem via almost-periodicity
On subsets of finite Abelian groups with no 3-term arithmetic progressions
An extension of Behrend's theorem
Roth's theorem in many variables
The equidistant dimension of graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
A new proof of Roth’s theorem on arithmetic progressions
A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
A proof of two Erdös conjectures on restricted addition and further results
An upper bound for the \(k\)-barycentric Davenport constant of groups of prime order
Integer sets containing no arithmetic progressions
Polynomial configurations in difference sets
Arithmetical progressions and the number of sums
Finding large 3-free sets. I. The small \(n\) case
On a problem of Gowers
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
On distinct distances and \(\lambda \)-free point sets
Finding linear patterns of complexity one
Title not available (Why is that?)
Analytic number theory. Abstracts from the workshop held November 3--9, 2019
Improved bound in Roth's theorem on arithmetic progressions
Title not available (Why is that?)
On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
Matrix progressions in multidimensional sets of integers
On sets of integers which contain no three terms in geometric progression
A generalization of Roth's theorem in function fields
On triples in arithmetic progression
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II
Arithmetic progressions, different regularity lemmas and removal lemmas
Roth's theorem in the Piatetski-Shapiro primes
Injective colorings with arithmetic constraints
Novel structures in Stanley sequences
On a diagonal quadric in dense variables
On Roth's theorem on progressions
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
Roth's theorem for four variables and additive structures in sums of sparse sets
Subset sums
From harmonic analysis to arithmetic combinatorics
A Roth-type theorem with mixed powers
On certain other sets of integers
Greedy algorithm, arithmetic progressions, subset sums and divisibility
Szemerédi's Theorem in the Primes
On improving Roth's theorem in the primes
New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
Integer sequences without singleton intersection
On sets of integers containing no four elements in arithmetic progression
On sets containing no geometric progression with integer ratio
Roth's theorem on progressions revisited
Generalizations of Fourier analysis, and how to apply them
A prime analogue of Roth's theorem in function fields
Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
Threshold functions and Poisson convergence for systems of equations in random sets
A Szemerédi-type theorem for subsets of the unit cube
Erdős and the integers
On sets of integers containing k elements in arithmetic progression
Progression-free sets in finite abelian groups.
New applications of the polynomial method: the cap set conjecture and beyond
Additive combinatorics and graph theory

This page was built for publication: Integer Sets Containing No Arithmetic Progressions

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