Small gaps between configurations of prime polynomials
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 GoldstonPintzYıldırım and GreenTao to find arbitrarily long arithmetic progressions of generalized twin primes.
 Publication:

arXiv eprints
 Pub Date:
 March 2015
 DOI:
 10.48550/arXiv.1503.01683
 arXiv:
 arXiv:1503.01683
 Bibcode:
 2015arXiv150301683P
 Keywords:

 Mathematics  Number Theory;
 Mathematics  Combinatorics