Polynomial mean complexity and logarithmic Sarnak conjecture

被引：3

作者：

Huang, Wen ^{[1
]}

Xu, Leiye ^{[1
]}

Ye, Xiangdong ^{[1
]}

机构：

[1] Univ Sci & Technol China, Hefei, Anhui, Peoples R China

来源：

ERGODIC THEORY AND DYNAMICAL SYSTEMS | 2024年 / 44卷 / 03期

关键词：

Mobius function; topological dynamics; polynomial complexity; packing dimension; AVERAGED CHOWLA;

D O I：

10.1017/etds.2023.22

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：769 / 798

页数：30

共 33 条

[31] Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
Grigoriev, Dima
Milman, Pierre D.
ADVANCES IN MATHEMATICS, 2012, 231 (06) : 3389 - 3428
[32] Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
Chee-Khian Sim
Computational Optimization and Applications, 2019, 74 : 583 - 621
[33] Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
Sim, Chee-Khian
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2019, 74 (02) : 583 - 621

← 1 2 3 4 →