Patterns of primes in arithmetic progressions

DOI10.1007/978-3-319-55357-3_19zbMATH Open1426.11092arXiv1509.01564OpenAlexW2105874812MaRDI QIDQ4581335FDOQ4581335

Authors: János Pintz 

Publication date: 17 August 2018

Published in: Number Theory – Diophantine Problems, Uniform Distribution and Applications (Search for Journal in Brave)

Abstract: We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic progressions. More precisely, the set of natural numbers n for which all components n+h_i (i=1,2,...m) are consecutive primes contains arbitrarily long (finite) arithmetic progressions. Moreover, the set of m-tuples that satisfy this property represents a positive proportion of all m-tuples. The present result is the generalization of the results of Green-Tao (about the existence of arbitrarily long arithmetic progressions) and of Maynard/Tao (about the existence of infinitely many bounded blocks of m primes, where m is an arbitrary natural number). It also generalizes the author's work which first showed the existence of infinitely many Polignac numbers and they contain arbitrarily long (finite) arithmetic progressions (arXiv: 1305.6289v1, 27 May 2013) which was a common generalization of the above mentioned result of Green-Tao and that of Zhang (about the exisatence of infinitely many bounded gaps between primes).

Full work available at URL: https://arxiv.org/abs/1509.01564

Recommendations

• Patterns of primes in Chebotarev sets
• Prime Number Patterns
• Consecutive primes in tuples
• A note on small gaps between primes in arithmetic progressions
• Primes in intervals of bounded length

Mathematics Subject Classification ID

Primes in congruence classes (11N13)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The primes contain arbitrarily long arithmetic progressions
• Bounded gaps between primes
• Are There Arbitrarily Long Arithmetic Progressions In The Sequence of Twin Primes?
• Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture
• Small gaps between primes
• Primes in tuples. I
• Title not available (Why is that?)
• Small gaps between products of two primes
• Small gaps between configurations of prime polynomials

Cited In (14)

• Patterns of primes in the Sato-Tate conjecture
• Multiple patterns of \(k\)-tuples of integers
• A transference principle for systems of linear equations, and applications to almost twin primes
• Patterns of primes in joint Sato-Tate distributions
• Obstructions to uniformity and arithmetic patterns in the primes
• Prime Number Patterns
• Vinogradov’s three primes theorem with almost twin primes
• Consecutive primes in tuples
• The twin prime conjecture
• On the prime power factorization of \(n!\)
• Patterns of primes in Chebotarev sets
• Title not available (Why is that?)
• Bounded gaps between primes in short intervals
• On a problem of Pillai and its generalizations

This page was built for publication: Patterns of primes in arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581335)