Indexed metadata

Effective estimates for exponential sums with multiplicative coefficients

Nicolas Robles

Source record

Source: arXiv

Published: Sep 10, 2026

arXiv: 2609.11070

Open original source ↗

Source abstract

Let ff be multiplicative, with f(p)A|f(p)|\le A at primes and nxf(n)2A2x\sum_{n\le x}|f(n)|^2\le A^2x for every x1x\ge1. If αa/qq2|α-a/q|\le q^{-2}, (a,q)=1(a,q)=1, and 3RqN/R3\le R\le q\le N/R, we prove nNf(n)e(nα)ANlogN+NRloglog(3R) \sum_{n\le N}f(n)\operatorname{e}(nα) \ll_A \frac{N}{\log N} +\frac{N}{\sqrt R}\sqrt{\log\log(3R)} with effective implied constants. Montgomery and Vaughan proved this with second term NR1/2(logR)3/2NR^{-1/2}(\log R)^{3/2}, and, for 11-bounded functions, Bachman replaced it by NR1/2logRloglogRNR^{-1/2}\sqrt{\log R\log\log R}. We remove the factor logR\sqrt{\log R} from Bachman's second term while retaining the original coefficient hypotheses of Montgomery and Vaughan. A more precise estimate records the distance from a rational number. The proof combines the Brun-Titchmarsh inequality on short intervals with maximal Fourier estimates derived from the Carleson-Hunt theorem; the local bounds permit arbitrary prime-dependent prefixes. We also prove sharpness of the square-root displacement dependence.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Effective estimates for exponential sums with multiplicative coefficients — Mathematical Frontier Network