Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Szemerédi's theorem in the primes (1709.04719v1)

Published 14 Sep 2017 in math.NT and math.CO

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.

Citations (3)

Summary

We haven't generated a summary for this paper yet.