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.