Szemerédi's Theorem in the Primes
From MaRDI portal
Publication:4631377
DOI10.1017/S0013091518000561zbMATH Open1472.11061arXiv1709.04719MaRDI QIDQ4631377FDOQ4631377
Authors: Luka Rimanić, Julia Wolf 
Publication date: 24 April 2019
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Abstract: Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to zero sufficiently slowly contains a 3-term term progression. This was followed by work of Helfgott and de Roton, and Naslund, who improved the bounds on the relative density in the case of 3-term progressions. The aim of this note is to present an analogous result for longer progressions by combining a quantified version of the relative Szemer'edi theorem given by Conlon, Fox and Zhao with Henriot's estimates of the enveloping sieve weights.
Full work available at URL: https://arxiv.org/abs/1709.04719
Recommendations
- Improving Roth's theorem in the primes
- On improving Roth's theorem in the primes
- On certain other sets of integers
- Integer Sets Containing No Arithmetic Progressions
- Szemerédi's theorem and problems on arithmetic progressions
- Narrow arithmetic progressions in the primes
- The primes contain arbitrarily long arithmetic progressions
- Arithmetic progressions and the primes
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
Cites Work
- Sets of integers that do not contain long arithmetic progressions
- A new proof of Szemerédi's theorem
- On Certain Sets of Positive Density
- The primes contain arbitrarily long polynomial progressions
- Roth's theorem in the primes
- The primes contain arbitrarily long arithmetic progressions
- Primes in tuples. I
- A relative Szemerédi theorem
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Improving Roth's theorem in the primes
- The Green-Tao theorem: an exposition
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- On improving Roth's theorem in the primes
- An arithmetic transference proof of a relative Szemerédi theorem
- On systems of complexity one in the primes
Cited In (15)
- Sophie Germain's theorem for prime pairs \(p, 6p+1\)
- Narrow arithmetic progressions in the primes
- A Tauberian Theorem and Analogues of the Prime Number Theorem
- The Gelfond–Schnirelman Method in Prime Number Theory
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Title not available (Why is that?)
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- On improving Roth's theorem in the primes
- On sums of sets of primes with positive relative density
- Title not available (Why is that?)
- Further bounds in the polynomial Szemerédi theorem over finite fields
- A short proof of the multidimensional Szemerédi theorem in the primes
- An arithmetic transference proof of a relative Szemerédi theorem
- Strings of special primes in arithmetic progressions
This page was built for publication: Szemerédi's Theorem in the Primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631377)
