Papers
Topics
Authors
Recent
Search
2000 character limit reached

Effective estimates for exponential sums with multiplicative coefficients

Published 10 Sep 2026 in math.NT | (2609.11070v1)

Abstract: Let ff be multiplicative, with f(p)A|f(p)|\le A at primes and nxf(n)<sup>2</sup>A<sup>2x\sum_{n\le x}|f(n)|<sup>2\le</sup> A<sup>2x for every x1x\ge1. If αa/qq<sup>2|α-a/q|\le q<sup>{-2}, (a,q)=1(a,q)=1, and 3RqN/R3\le R\le q\le N/R, we prove [ \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 NR<sup>1/2(log</sup>R)<sup>3/2NR<sup>{-1/2}(\log</sup> R)<sup>{3/2}, and, for $1$-bounded functions, Bachman replaced it by NR<sup>1/2log</sup>RloglogRNR<sup>{-1/2}\sqrt{\log</sup> 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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.