arXiv · 1503.01683
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 Goldston-Pintz-Y\i ld\i r\i m and Green-Tao to find arbitrarily long arithmetic progressions of generalized twin primes.
Explore related subjects
Keep this discovery
Hans Parshall. 2015-03-05. Small gaps between configurations of prime polynomials. https://arxiv.org/abs/1503.01683
Cite the original work for its findings. Save a collection to share your selection of sources.