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

DOI10.1112/MTK.12170zbMATH Open1523.11144arXiv2202.00521OpenAlexW4304172266MaRDI QIDQ6074985FDOQ6074985

Authors: Maxim Gerspach 

Publication date: 20 September 2023

Published in: Mathematika (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2202.00521

Recommendations

• A model problem for multiplicative chaos in number theory
• On mean values of random multiplicative functions
• Almost Sure Large Fluctuations of Random Multiplicative Functions
• Moments of random multiplicative functions. I: Low moments, better than squareroot cancellation, and critical multiplicative chaos
• Sums of random multiplicative functions over function fields with few irreducible factors

zbMATH Keywords

multiplicative chaos

Mathematics Subject Classification ID

Arithmetic functions in probabilistic number theory (11K65) Rate of growth of arithmetic functions (11N56)

Cites Work

• 75.9 Euler’s Constant
• On mean values of random multiplicative functions
• An almost sure upper bound for random multiplicative functions on integers with a large prime factor
• Moments of random multiplicative functions. I: Low moments, better than squareroot cancellation, and critical multiplicative chaos
• A conjectural asymptotic formula for multiplicative chaos in number theory
• A model problem for multiplicative chaos in number theory

Cited In (2)

• Better than square-root cancellation for random multiplicative functions
• A model problem for multiplicative chaos in number theory

This page was built for publication: Almost sure lower bounds for a model problem for multiplicative chaos in number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074985)