Abstract
A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer is a primitive root, provided and is not a perfect square. Thanks to work of Hooley, we know that this conjecture is true, conditional on the truth of the Generalized Riemann Hypothesis. Using a combination of Hooley's analysis and the techniques of Maynard-Tao used to prove the existence of bounded gaps between primes, Pollack has shown that (conditional on GRH) there are bounded gaps between primes with a prescribed primitive root. In the present article, we provide an unconditional proof of the analogue of Pollack's work in the function field case; namely, that given a monic polynomial which is not an th power for any prime dividing , there are bounded gaps between monic irreducible polynomials in for which is a primitive root (which is to say that generates the group of units modulo ). In particular, we obtain bounded gaps between primitive polynomials, corresponding to the choice .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.