Szemerédi's Theorem in the Primes

DOI10.1017/S0013091518000561zbMath1472.11061arXiv1709.04719MaRDI QIDQ4631377

Julia Wolf, Luka Rimanić

Publication date: 24 April 2019

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

Full work available at URL: https://arxiv.org/abs/1709.04719

zbMATH Keywords

pseudorandomnessarithmetic combinatoricsSzemerédi's theoremGreen-Tao theorem

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (1)

Further bounds in the polynomial Szemer

Cites Work

• The Green-Tao theorem: an exposition
• Sets of integers that do not contain long arithmetic progressions
• Primes in tuples. I
• The primes contain arbitrarily long polynomial progressions
• Roth's theorem in the primes
• A relative Szemerédi theorem
• The primes contain arbitrarily long arithmetic progressions
• On Systems of Complexity One in the Primes
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• On Certain Sets of Positive Density
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
• ON IMPROVING ROTH'S THEOREM IN THE PRIMES
• Improving Roth's Theorem in the Primes
• An arithmetic transference proof of a relative Szemerédi theorem
• A new proof of Szemerédi's theorem

This page was built for publication: Szemerédi's Theorem in the Primes