Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 48 min ago
PreprintCC BY 4.0arXiv

A folklore conjecture on multiplicative exponential sums

Abstract

We prove a folklore conjecture on exponential sums with multiplicative coefficients: if f is multiplicative with |f(n)|≤1, (a,q)=1, |α−a/q|≤ q−2 and q≤ N/(log N)2, then ∑n≤ Nf(n)e(nα)≪N/(log N)+N/√q. Complete multiplicativity is not required. We also prove two related conjectured bounds: the refinement in which q is replaced by q(1+N|α−a/q|), when this quantity is at most N/(log N)2, and the corresponding bound for the sum with logarithmic weights. Finally, we show that the bound can fail for multiplicative f satisfying only |f(p)|≤ A at primes and ∑n≤ x|f(n)|2≤ A2x, for every fixed A>1.

Related

  1. Logarithmic exponential sums with multiplicative coefficients
    Haozhe Gou
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. On exponential sums with multiplicative coefficients
    Haozhe Gou
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Effective estimates for exponential sums with multiplicative coefficients
    Nicolas Robles
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Low moments of automorphic random multiplicative function sums
    Sun-Kai Leung
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryProbabilityarXiv
  5. A sharp almost sure upper bound for partial sums of random multiplicative functions
    Benjamin Durkan, Andrew Pearce-Crump
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryProbabilityarXiv
BibTeX
@misc{robles2026folklore,
  title = {{A folklore conjecture on multiplicative exponential sums}},
  author = {Nicolas Robles},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.19464},
  eprint = {2610.19464},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.19464},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A folklore conjecture on multiplicative exponential sums
AU  - Nicolas Robles
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.19464
UR  - https://arxiv.org/abs/2610.19464
AB  - We prove a folklore conjecture on exponential sums with multiplicative coefficients: if f is multiplicative with |f(n)|≤1, (a,q)=1, |α−a/q|≤ q^−2 and q≤ N/(log N)^2, then ∑_n≤ Nf(n)e(nα)≪N/(log N)+N/√q. Complete multiplicativity is not required. We also prove two related conjectured bounds: the refinement in which q is replaced by q(1+N|α−a/q|), when this quantity is at most N/(log N)^2, and the corresponding bound for the sum with logarithmic weights. Finally, we show that the bound can fail for multiplicative f satisfying only |f(p)|≤ A at primes and ∑_n≤ x|f(n)|^2≤ A^2x, for every fixed A>1.
ER  -