Polynomial differences in the primes

DOI10.1007/978-1-4939-1601-6_10zbMATH Open1358.11096arXiv1103.5030OpenAlexW1752379781MaRDI QIDQ5265393FDOQ5265393

Authors: Neil Lyall, Alex Rice 

Publication date: 23 July 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Abstract: We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences are replaced with any integer linear combination of two primes.

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

Recommendations

• Difference sets and polynomials of prime variables
• Polynomial patterns in the primes
• Primes in tuples. II
• On prime vs. prime power pairs
• Asymptotics for some polynomial patterns in the primes

zbMATH Keywords

Hardy-Littlewood circle methodpolynomial differences

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Distribution of primes (11N05) Applications of the Hardy-Littlewood method (11P55)

Cited In (6)

• Asymptotics for some polynomial patterns in the primes
• About Polynomials Whose Divided Differences are Integer-Valued on Prime Numbers
• On prime vs. prime power pairs
• Difference sets and polynomials of prime variables
• A remark on Polignac’s conjecture
• Polynomial patterns in the primes

This page was built for publication: Polynomial differences in the primes

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