论文标题
在数字理论中，几乎确定乘法混乱的模型问题的下限
Almost sure lower bounds for a model problem for multiplicative chaos in number theory
论文作者
论文摘要
这项工作的目的是证明Harper在几乎确定随机乘法功能的下限的最新结果的类似物，在可以将其视为简化函数字段类似物的环境中。它回答了一个在Soundararajan和Zaman的作品中提出的问题，他们以与随机乘法环境中的Harper相同的数量证明了时刻的界限。拥有更简单的数量可以使我们能够使证据接近独立，也许更容易访问。
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.
