arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.00521math.NTmath.PR
收藏

数论中一类乘性混沌模型问题的几乎必然下界

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

Maxim Gerspach

摘要:

这项工作的目标是证明一个模拟的哈珀最近的结果几乎必然随机乘性函数的下界,在一个设置,可以被认为是一个简化的功能域模拟。它回答了一个问题提出的工作Soundararajan和扎曼,谁证明了目前的界限相同数量的类比哈珀在随机乘法设置。有了一个更简单的量,我们就可以使证明接近于完备,也许更容易理解。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑