Rachid Caich

activity

20232026

most citedAlmost sure upper bound for random multiplicative functions

3 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing 2023 · math.NTShow all

2 papers · 2 filters

math.NT2023

Almost sure upper bound for a model problem for multiplicative chaos in number theory

Rachid Caich

The goal of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result o…

math.NT2023★ 3 cited

Almost sure upper bound for random multiplicative functions

Rachid Caich

Let $ε > 0$ . Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to + \infty$ , $$ \sum_{n \leqslant x} f(n) \ll…