Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An almost sure upper bound for random multiplicative functions on integers with a large prime factor (2105.09565v1)

Published 20 May 2021 in math.NT

Abstract: Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x){1/4+\varepsilon},$$ where $P(n)$ stands for the largest prime factor of $n$. This gives an indication of the almost sure size of the largest fluctuations of $f$.

Summary

We haven't generated a summary for this paper yet.