Bounded gaps between prime polynomials with a given primitive root
From MaRDI portal
Publication:897340
DOI10.1016/J.FFA.2015.11.001zbMATH Open1402.11117arXiv1503.06634OpenAlexW1708786088MaRDI QIDQ897340FDOQ897340
Publication date: 17 December 2015
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1503.06634
Recommendations
Cites Work
Cited In (2)
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)