Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Improving Roth's Theorem in the Primes

Published 10 Feb 2013 in math.NT and math.CO | (1302.2299v2)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.