Bounded gaps between prime polynomials with a given primitive root

preprint2015arXivOpen access

Abstract

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer gg is a primitive root, provided g≠−1g \neq -1 and gg 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)g(t) which is not an vvth power for any prime vv dividing q−1q-1, there are bounded gaps between monic irreducible polynomials P(t)P(t) in Fq[t]\mathbb{F}_q[t] for which g(t)g(t) is a primitive root (which is to say that g(t)g(t) generates the group of units modulo P(t)P(t)). In particular, we obtain bounded gaps between primitive polynomials, corresponding to the choice g(t)=tg(t) = t.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.