Almost sure lower bounds for a model problem for multiplicative chaos in number theory
From MaRDI portal
Publication:6074985
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.
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
Cites work
- 75.9 Euler’s Constant
- A conjectural asymptotic formula for multiplicative chaos in number theory
- A model problem for multiplicative chaos in number theory
- 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
- On mean values of random multiplicative functions
Cited in
(2)
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)
