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

2023/04/04 by Rachid Caich, Caich, Rachid
Computer Science · Mathematics · #Chaos-based Image/Signal Encryption #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT) #Probability (math.PR) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.2304.01632

openalex publication_date 2023/04/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Almost sure lower bounds for a model problem for multiplicative chaos in number theory
• Sharp inequalities involving multiplicative chaos sums
• Hölder type estimates for Gaussian multiplicative chaos
• Universal tail profile of Gaussian multiplicative chaos
• An almost sure upper bound for random multiplicative functions on integers with a large prime factor