A Density Increment Approach to Roth's Theorem in the Primes

arXiv1409.3595MaRDI QIDQ6254590FDOQ6254590

Authors: Eric Naslund 

Publication date: 11 September 2014

Abstract: We prove that if $A$ is any set of prime numbers satisfying [ sum_{ain A}frac{1}{a}=infty, ] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density increment argument, exploiting the structure of the primes to obtain a large density increase at each step of the iteration. The argument shows that for any $B>0$, and $N>N_0(B)$, if $A$ is a subset of primes contained in $1,dots,N$ with relative density $alpha(N)=(|A|logN)/N$ at least [ alpha(N)gg_{B}left(loglog N ight)^{-B} ] then $A$ contains a $3$-term arithmetic progression.

This page was built for publication: A Density Increment Approach to Roth's Theorem in the Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254590)