Bounded gaps between prime polynomials with a given primitive root

From MaRDI portal




Abstract: A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer g is a primitive root, provided geq1 and g 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 g(t) which is not an vth power for any prime v dividing q1, there are bounded gaps between monic irreducible polynomials P(t) in mathbbFq[t] for which g(t) is a primitive root (which is to say that g(t) generates the group of units modulo P(t)). In particular, we obtain bounded gaps between primitive polynomials, corresponding to the choice g(t)=t.









This page was built for publication: Bounded gaps between prime polynomials with a given primitive root

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897340)