Integer Sets Containing No Arithmetic Progressions

From MaRDI portal
Publication:3717154

DOI10.1112/jlms/s2-35.3.385zbMath0589.10062OpenAlexW2041824078WikidataQ56341562 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



Related Items

Logarithmic bounds for Roth's theorem via almost-periodicity, Additive combinatorics and graph theory, A Szemerédi-type theorem for subsets of the unit cube, Subset sums, On subsets of finite Abelian groups with no 3-term arithmetic progressions, Generalizations of Fourier analysis, and how to apply them, The equidistant dimension of graphs, Integer sets containing no arithmetic progressions, A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1., ON A DIAGONAL QUADRIC IN DENSE VARIABLES, New applications of the polynomial method: The cap set conjecture and beyond, On certain other sets of integers, Uniform hypergraphs containing no grids, A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II, A generalization of Roth's theorem in function fields, Tower-type bounds for Roth's theorem with popular differences, Injective colorings with arithmetic constraints, Novel structures in Stanley sequences, Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes, 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, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, Threshold functions and Poisson convergence for systems of equations in random sets, On Roth's theorem on progressions, Progression-free sets in finite abelian groups., Erdős and the integers, Analytic number theory. Abstracts from the workshop held November 3--9, 2019, Unnamed Item, Finding large 3-free sets. I. The small \(n\) case, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Roth's theorem on progressions revisited, Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small, Arithmetical progressions and the number of sums, MATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERS, ON IMPROVING ROTH'S THEOREM IN THE PRIMES, An upper bound for the \(k\)-barycentric Davenport constant of groups of prime order, Roth's theorem in many variables, A proof of two Erdös conjectures on restricted addition and further results, ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS, On distinct distances and \(\lambda \)-free point sets, Polynomial configurations in difference sets, Improved bound in Roth's theorem on arithmetic progressions, A new proof of Roth’s theorem on arithmetic progressions, A Prime Analogue of Roth’s Theorem in Function Fields, A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression, Arithmetic progressions, different regularity lemmas and removal lemmas, Roth's theorem in the Piatetski-Shapiro primes, A Roth-type theorem with mixed powers, On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets, On sets of integers which contain no three terms in geometric progression, From harmonic analysis to arithmetic combinatorics, Greedy algorithm, arithmetic progressions, subset sums and divisibility