Almost sure upper bound for a model problem for multiplicative chaos in number theory
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913896764276736 |
|---|---|
| author | Caich, Rachid |
| author_facet | Caich, Rachid |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_01632 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Almost sure upper bound for a model problem for multiplicative chaos in number theory Caich, Rachid Number Theory Probability 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. |
| title | Almost sure upper bound for a model problem for multiplicative chaos in number theory |
| topic | Number Theory Probability |
| url | https://arxiv.org/abs/2304.01632 |