Polynomial progressions in the generalized twin primes
Abstract
By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer b≤ 246 such that there are infinitely many primes p such that p+b is also prime. Let P1,...,Pt∈ Z[y] with P1(0)=·s=Pt(0)=0. We use the transference argument of Tao and Ziegler to prove there exist positive integers x, y, and b ≤ 246 such that x+P1(y),x+P2(y),...,x+Pt(y) and x+P1(y)+b,x+P2(y)+b,...,x+Pt(y)+b are all prime. Our work is inspired by Pintz, who proved a similar result for the special case of arithmetic progressions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.