Small gaps between configurations of prime polynomials
From MaRDI portal
Abstract: We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of Goldston-Pintz-Yi ldi ri m and Green-Tao to find arbitrarily long arithmetic progressions of generalized twin primes.
Recommendations
Cites work
- scientific article; zbMATH DE number 1716471 (Why is no real title available?)
- Are There Arbitrarily Long Arithmetic Progressions In The Sequence of Twin Primes?
- Bounded gaps between primes
- Green-Tao theorem in function fields
- Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture
- Primes in tuples. I
- Small gaps between primes
- The primes contain arbitrarily long arithmetic progressions
- Variants of the Selberg sieve, and bounded intervals containing many primes
Cited in
(3)
This page was built for publication: Small gaps between configurations of prime polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907475)