On triples in arithmetic progression
From MaRDI portal
It was shown by \textit{K. F. Roth} [J. Lond. Math. Soc. 28, 104-109 (1953; Zbl 0050.04002)] that a set \(A\) of positive integers \(n\leq x\) containing \(\gg x(\log\log x)^{-1}\) elements, must contain three distinct terms in arithmetic progression. The result was sharpened by the reviewer [J. Lond. Math. Soc. (2) 35, 385-394 (1987; Zbl 0589.10062)] and \textit{E. Szemerédi} [Acta Math. Hung. 56, 155-158 (1990; Zbl 0721.11007)], to show that \(\gg x(\log x)^{-c}\) terms suffice, for a certain positive constant \(c\). The present paper shows that in fact it is enough for \(A\) to contain \(\gg x(\log\log x/\log x)^{1/2}\) terms. The author uses a form of the circle method, but instead of examining the behaviour of \(A\) in arithmetic progressions, one uses `Bohr sets' defined by conditions of the form \(\|n\theta_j\|< \delta\) for \(j\leq J\).
Recommendations
Cited in
(91)- Progression-free sets in finite abelian groups.
- Additive combinatorics and graph theory
- The cardinality of restricted sumsets.
- A generalization of Roth's theorem in function fields
- Caps and progression-free sets in \(\mathbb{Z}_m^n\)
- Roth's theorem in many variables
- A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
- Improved bound in Roth's theorem on arithmetic progressions
- Structure and regularity for subsets of groups with finite VC-dimension
- The equidistant dimension of graphs
- On the spectral gap and the diameter of Cayley graphs
- Nil Bohr₀-sets and polynomial recurrence
- A lower bound for off-diagonal van der Waerden numbers
- Bounds in Cohen's idempotent theorem
- Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
- Avoiding triples in arithmetic progression
- Restriction theory of the Selberg sieve, with applications
- Density and Ramsey type results on algebraic equations with restricted solution sets
- The Littlewood-Gowers problem
- Finite field models in arithmetic combinatorics -- ten years on
- Integer sets containing no arithmetic progressions
- Sets in \(\mathbb{Z}^k\) with doubling \(2^k + \delta\) are near convex progressions
- Polynomial configurations in subsets of random and pseudo-random sets
- Additive dimension and a theorem of Sanders
- Roth's theorem for four variables and additive structures in sums of sparse sets
- A prime analogue of Roth's theorem in function fields
- Arithmetic progressions in sets of small doubling
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Mixing for progressions in nonabelian groups.
- Every odd number greater than 1 is the sum of at most five primes
- Approximate groups and doubling metrics
- Some properties of lower level-sets of convolutions
- On double 3-term arithmetic progressions
- On systems of complexity one in the primes
- An inverse theorem for the Gowers U^4-norm
- Linear forms and quadratic uniformity for functions on F^n_p
- Generalizations of Fourier analysis, and how to apply them
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tilted corners in integer grids
- Additive structures in sumsets
- A Note on Freĭman's Theorem in Vector Spaces
- On certain other sets of integers
- A new proof of Roth’s theorem on arithmetic progressions
- scientific article; zbMATH DE number 3455459 (Why is no real title available?)
- The quantitative behaviour of polynomial orbits on nilmanifolds
- New applications of the polynomial method: the cap set conjecture and beyond
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- Triples of primes in arithmetic progressions
- The structure theory of set addition revisited
- Popular differences for corners in abelian groups
- The NOF multiparty communication complexity of composed functions
- Bootstrapping partition regularity of linear systems
- On finite sets of small tripling or small alternation in arbitrary groups
- Solving equations in dense Sidon sets
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Quantitative structure of stable sets in finite abelian groups
- The Erdős-Moser sum-free set problem
- On improving Roth's theorem in the primes
- Logarithmic bounds for Roth's theorem via almost-periodicity
- Perfect Hash Families: Constructions and Existence
- What is good mathematics?
- On sets of integers which contain no three terms in geometric progression
- From harmonic analysis to arithmetic combinatorics
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Exploring the toolkit of Jean Bourgain
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- On triads of compositions in an even
- Tower-type bounds for Roth's theorem with popular differences
- Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
- Extremal Sidon sets are Fourier uniform, with applications to partition regularity
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
- A quantitative version of the non-Abelian idempotent theorem
- On Roth's theorem on progressions
- Wasserstein convergence in Bayesian and frequentist deconvolution models
- Improved bounds for five-term arithmetic progressions
- Arithmetic progressions at the journal of the LMS
- Perfect proper edge colorings of regular bipartite graphs with rainbow \(C_4\)-\(\mathrm{s}\)
- On Fourier coefficients of sets with small doubling
- A note on sumsets of progression-free sets
- On Freiman-Lev conjecture
- Essentially tight bounds for rainbow cycles in proper edge-colourings
- A Freĭman-type theorem for locally compact Abelian groups
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Roth's theorem in the Piatetski-Shapiro primes
- A Roth-type theorem with mixed powers
- Injective colorings with arithmetic constraints
- Finding large 3-free sets. I. The small \(n\) case
- Roth's theorem on progressions revisited
This page was built for publication: On triples in arithmetic progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964140)
