Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-07T01:32:09.498Z Has data issue: false hasContentIssue false

Polynomial mean complexity and logarithmic Sarnak conjecture

Published online by Cambridge University Press:  27 April 2023

WEN HUANG
Affiliation:
CAS Wu Wen-Tsun Key Laboratory of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China (e-mail: wenh@mail.ustc.edu.cn, yexd@ustc.edu.cn)
LEIYE XU*
Affiliation:
CAS Wu Wen-Tsun Key Laboratory of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China (e-mail: wenh@mail.ustc.edu.cn, yexd@ustc.edu.cn)
XIANGDONG YE
Affiliation:
CAS Wu Wen-Tsun Key Laboratory of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, PR China (e-mail: wenh@mail.ustc.edu.cn, yexd@ustc.edu.cn)
Rights & Permissions [Opens in a new window]

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.

Information

Type
Original Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press