Log-free bounds on exponential sums over primes

Abstract

We establish completely log-free bounds for exponential sums over the primes and the M\"obius function. Let 0<η ≤ 1/10, and suppose α = a/q + δ/x, with (a,q)=1 and |δ| ≤ x1/5 + η/q, and set δ0 = (1, |δ|/4). For x ≥ x0(η) sufficiently large, we show that: equation* | Σn ≤ x (n) e(nα) | ≤ q(q) Fη( δ0 q x, + δ0/q x ) · x δ0 q \ and \ | Σn ≤ x μ(n) e(nα) | ≤ Gη( δ0 q x, + δ0/q x ) · xδ0 (q), equation* for all 1 ≤ q ≤ x2/5 - η, where + z = ( z, 0), and the functions Fη and Gη are explicitly determined, taking small to moderate values. These bounds improve substantially upon the existing results - particularly with respect to the permissible ranges of q, δ in which log-free bounds are known to hold and potentially with respect to asymptotic functions Fη and Gη as well. Moreover, the range 1 ≤ q ≤ x2/5 - η is essentially the best possible we can expect. The main innovation is a sieve-weighted version of Vaughan's identity (Lemma 2.1), which is effectively log-free. We employ several ideas and results from the pioneering work of Helfgott, and particularly, they play a central role in ensuring the log-freeness of the type-I contribution. Also, like in his work, these bounds improve as δ increases.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…