Small gaps between configurations of prime polynomials
Number Theory
2015-03-06 v1 Combinatorics
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-Y\i ld\i r\i m and Green-Tao to find arbitrarily long arithmetic progressions of generalized twin primes.
Cite
@article{arxiv.1503.01683,
title = {Small gaps between configurations of prime polynomials},
author = {Hans Parshall},
journal= {arXiv preprint arXiv:1503.01683},
year = {2015}
}