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.









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)