English

Bounds for exponential sums with random multiplicative coefficients

Number Theory 2025-11-10 v1

Abstract

For ff a Rademacher or Steinhaus random multiplicative function, we prove that maxθ[0,1]1NnNf(n)e(nθ)logN, \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{n \leq N} f(n) \mathrm{e} (n \theta) \Bigr| \gg \sqrt{\log N} , asymptotically almost surely as NN \rightarrow \infty. Furthermore, for ff a Steinhaus random multiplicative function, and any ε>0\varepsilon > 0, we prove the partial upper bound result maxθ[0,1]1NnNP(n)N0.8f(n)e(nθ)(logN)7/4+ε, \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{\substack{n \leq N \\ P(n) \geq N^{0.8}}} f(n) \mathrm{e} (n \theta) \Bigr| \ll {(\log N)}^{7/4 + \varepsilon}, asymptotically almost surely as NN \rightarrow \infty, where P(n)P(n) denotes the largest prime factor of nn.

Keywords

Cite

@article{arxiv.2401.16256,
  title  = {Bounds for exponential sums with random multiplicative coefficients},
  author = {Seth Hardy},
  journal= {arXiv preprint arXiv:2401.16256},
  year   = {2025}
}

Comments

21 pages. Comments welcome

R2 v1 2026-06-28T14:30:23.095Z