Almost sure upper bound for a model problem for multiplicative chaos in number theory
Number Theory
2025-06-18 v2 Probability
Abstract
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 of the author concerning almost sure upper bound of random multiplicative functions. Having a simpler quantity allows us to make the proof more accessible.
Keywords
Cite
@article{arxiv.2304.01632,
title = {Almost sure upper bound for a model problem for multiplicative chaos in number theory},
author = {Rachid Caich},
journal= {arXiv preprint arXiv:2304.01632},
year = {2025}
}
Comments
arXiv admin note: text overlap with arXiv:2304.00943