English

Polynomial progressions in the generalized twin primes

Number Theory 2026-03-24 v2 Combinatorics

Abstract

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer b246b\leq 246 such that there are infinitely many primes pp such that p+bp+b is also prime. Let P1,...,PtZ[y]P_1,...,P_t\in \mathbb{Z}[y] with P1(0)==Pt(0)=0P_1(0)=\cdots=P_t(0)=0. We use the transference argument of Tao and Ziegler to prove there exist positive integers x,y,x, y, and b246b \leq 246 such that x+P1(y),x+P2(y),...,x+Pt(y)x+P_1(y),x+P_2(y),...,x+P_t(y) and x+P1(y)+b,x+P2(y)+b,...,x+Pt(y)+bx+P_1(y)+b,x+P_2(y)+b,...,x+P_t(y)+b are all prime. Our work is inspired by Pintz, who proved a similar result for the special case of arithmetic progressions.

Keywords

Cite

@article{arxiv.2505.17375,
  title  = {Polynomial progressions in the generalized twin primes},
  author = {Andrew Lott and Nagendar Reddy Ponagandla},
  journal= {arXiv preprint arXiv:2505.17375},
  year   = {2026}
}

Comments

Minor revisions

R2 v1 2026-07-01T02:32:57.491Z