2017/11/23 by Sam Porritt, Porritt, Sam
Computer Science · Mathematics · #Advanced Mathematical Identities #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1711.08729
openalex publication_date 2017/11/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 1991, Baker and Harman proved, under the assumption of the generalized Riemann hypothesis, that max θ∈ [0,1) |∑ n ≤ x μ(n) e(n θ) | ≪εx3/4 + ε. The purpose of this note is to deduce an analogous bound in the context of polynomials over a finite field using Weil's Riemann Hypothesis for curves over a finite field. Our approach is based on the work of Hayes who studied exponential sums over irreducible polynomials.