arXiv · 2304.01632
Almost sure upper bound for a model problem for multiplicative chaos in number theory
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.
Explore related subjects
Keep this discovery
Rachid Caich. 2023-04-04. Almost sure upper bound for a model problem for multiplicative chaos in number theory. https://doi.org/10.1017/s030500412500026x
Cite the original work for its findings. Save a collection to share your selection of sources.