arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.02090math.DS
收藏

Polynomial mean complexity and Logarithmic Sarnak conjecture

Wen Huang, Leiye Xu, Xiangdong Ye

英文摘要:

In this paper, we reduce the logarithmic Sarnak conjecture to the $\{0,1\}$-symbolic systems with polynomial mean complexity. By showing that the logarithmic Sarnak conjecture holds for any topologically dynamical system with sublinear complexity, we provide a variant of the $1$-Fourier uniformity conjecture, where the frequencies are restricted to any subset of $[0,1]$ with packing dimension less than one.

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

↑