Small gaps between configurations of prime polynomials

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.