English

On Improving Roth's Theorem in the Primes

Number Theory 2019-02-20 v2 Combinatorics

Abstract

Let A{1,,N}A\subset\left\{ 1,\dots,N\right\} be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that AA has relative density α=A/π(N)\alpha=|A|/\pi(N), where π(N)\pi(N) denotes the number of primes in the set {1,,N}\left\{ 1,\dots,N\right\} . By modifying Helfgott and De Roton's work, we improve their bound and show that α(logloglogN)6loglogN.\alpha\ll\frac{\left(\log\log\log N\right)^{6}}{\log\log N}.

Keywords

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

R2 v1 2026-06-21T23:23:45.309Z