Bounds for Exponential Sums With Random Multiplicative Coefficients

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$.

Authors

Institutions

Publication Details

Journal
International Mathematics Research Notices
Published
2024-10-21
DOI
https://doi.org/10.1093/imrn/rnae234
Citations
1
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.89

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bounds for Exponential Sums With Random Multiplicative Coefficients

Seth Hardy
1 citations
International Mathematics Research Notices
Stochastic processes and statistical mechanics
0.89
article

Bounds for Exponential Sums With Random Multiplicative Coefficients

Seth Hardy
article en
1 citations

Abstract

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$.

International Mathematics Research NoticesVol. 2024(22)
University of Warwick (GB)
University of Warwick
Openalex Percentile: Top 27%
Stochastic processes and statistical mechanics
0.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.