vix.ing · top · new · best · stats · spec

Almost sure lower bounds for a model problem for multiplicative chaos in number theory

2022/02/01 by Maxim Gerspach, Gerspach, Maxim
Mathematics · #Mathematical Dynamics and Fractals #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.2202.00521

Abstract

The goal of this work is to prove an analogue of a recent result of Harper on almost sure lower bounds of random multiplicative functions, in a setting that can be thought of as a simplified function field analogue. It answers a question raised in work of Soundararajan and Zaman, who proved moment bounds for the same quantity in analogy to those of Harper in the random multiplicative setting. Having a simpler quantity allows us to make the proof close to self-contained, and perhaps somewhat more accessible.

Related