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

DOI10.1112/mtk.12170zbMath1523.11144arXiv2202.00521OpenAlexW4304172266MaRDI QIDQ6074985

Maxim Gerspach

Publication date: 20 September 2023

Published in: Mathematika (Search for Journal in Brave)

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

zbMATH Keywords

multiplicative chaos

Mathematics Subject Classification ID

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

Related Items (1)

Better than square-root cancellation for random multiplicative functions

Cites Work

• An almost sure upper bound for random multiplicative functions on integers with a large prime factor
• A conjectural asymptotic formula for multiplicative chaos in number theory
• A model problem for multiplicative chaos in number theory
• On mean values of random multiplicative functions
• MOMENTS OF RANDOM MULTIPLICATIVE FUNCTIONS, I: LOW MOMENTS, BETTER THAN SQUAREROOT CANCELLATION, AND CRITICAL MULTIPLICATIVE CHAOS
• 75.9 Euler’s Constant

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