arXiv · 2009.02090
Polynomial mean complexity and Logarithmic Sarnak conjecture
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Wen Huang, Leiye Xu, Xiangdong Ye. 2020-09-04. Polynomial mean complexity and Logarithmic Sarnak conjecture. https://arxiv.org/abs/2009.02090
Cite the original work for its findings. Save a collection to share your selection of sources.