On Artin's conjecture on average and short character sums
Oleksiy Klurman, Igor E. Shparlinski, Joni Ter\"av\"ainen

TL;DR
This paper proves that for most integers within a certain range, the distribution of primes for which these integers are primitive roots aligns with Artin's conjecture, using new short character sum estimates.
Contribution
It establishes the asymptotic behavior of primitive root counts for almost all integers up to a specified bound, improving previous results with novel character sum bounds.
Findings
Proves Artin's conjecture holds on average for most integers in a specific range.
Introduces a new short character sum estimate over integers.
Enhances the range of applicability compared to previous results.
Abstract
Let denote the number of primes up to for which the integer is a primitive root. We show that satisfies the asymptotic predicted by Artin's conjecture for almost all . This improves on a result of Stephens (1969). A key ingredient in the proof is a new short character sum estimate over the integers, improving on the range of a result of Garaev (2006).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Finite Group Theory Research
