Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds for exponential sums with random multiplicative coefficients

Published 29 Jan 2024 in math.NT | (2401.16256v1)

Abstract: For $f$ a Rademacher or Steinhaus random multiplicative function, we prove that $$ \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 $N \rightarrow \infty$. Furthermore, for $f$ a Steinhaus random multiplicative function, and any $\varepsilon > 0$, we prove the partial upper bound result $$ \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 $N \rightarrow \infty$, where $P(n)$ denotes the largest prime factor of $n$.

Citations (1)

Summary

Whiteboard

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

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

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