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 条
  • [21] A Polynomial Complexity Optimal Multiuser Detection Algorithm Based on Monotonicity Properties
    Quan, Qingyi
    ETRI JOURNAL, 2010, 32 (03) : 479 - 481
  • [22] Polynomial complexity optimal detection of certain multiple-access systems
    Schlegel, C
    Grant, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) : 2246 - 2248
  • [23] D-stability Characterization Problem Can Exhibit A Polynomial Computational Complexity
    Pavani, Raffaella
    INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM-2018), 2019, 2116
  • [24] Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
    Zhang, Jian
    Zhang, Kecun
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2011, 73 (01) : 75 - 90
  • [25] A Polynomial Complexity Algorithm for Near-optimal Signal Detection in Linear Gaussian Vector Channels
    Quan, Qingyi
    Xie, Suzi
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 9 (ICCSIT 2010), 2010, : 223 - 226
  • [26] Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
    Jian Zhang
    Kecun Zhang
    Mathematical Methods of Operations Research, 2011, 73 : 75 - 90
  • [27] An infeasible Mizuno-Todd-Ye type algorithm for convex quadratic programming with polynomial complexity
    Wang, Yanjin
    Fei, Pusheng
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2007, 28 (3-4) : 487 - 502
  • [28] A note on polynomial complexity optimal multiuser detection for certain non-orthogonal CDMA signals
    Aik, TB
    Motani, M
    Joon, LT
    ICCS 2002: 8TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2002, : 889 - 893
  • [29] Optimal Petri-Net-Based Polynomial-Complexity Deadlock-Avoidance Policies for Automated Manufacturing Systems
    Xing, Keyi
    Zhou, MengChu
    Liu, Huixia
    Tian, Feng
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2009, 39 (01): : 188 - 199
  • [30] Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over Zp
    Du, Xinyu
    Wang, Chao
    Wang, Tianze
    Gao, Zeyu
    INFORMATION SCIENCES, 2022, 594 : 163 - 176
1234