On Improving Roth's Theorem in the Primes
Number Theory
2019-02-20 v2 Combinatorics
Abstract
Let be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that has relative density , where denotes the number of primes in the set . By modifying Helfgott and De Roton's work, we improve their bound and show that
Cite
@article{arxiv.1302.2299,
title = {On Improving Roth's Theorem in the Primes},
author = {Eric Naslund},
journal= {arXiv preprint arXiv:1302.2299},
year = {2019}
}
Comments
14 pages, to appear in Mathematika