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

TL;DR
This paper proves that any set of primes with divergent harmonic sum contains a 3-term arithmetic progression, using a density increment strategy combined with the transference principle to exploit prime structure.
Contribution
It introduces a novel density increment approach to Roth's theorem specifically tailored for primes, advancing the understanding of arithmetic progressions in prime sets.
Findings
Sets of primes with divergent harmonic sum contain 3-term arithmetic progressions.
The method achieves progress for sets with density at least a polylogarithmic factor.
The approach combines transference principles with density increment techniques.
Abstract
We prove that if is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then must contain a -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 , and , if is a subset of primes contained in with relative density at least \[ \alpha(N)\gg_{B}\left(\log\log N\right)^{-B} \] then contains a -term arithmetic progression.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
