Bracket words along Hardy field sequences

被引：0
|
作者：
Konieczny, Jakub [1 ,2 ]
Muellner, Clemens [3 ]
机构：
[1] Univ Claude Bernard Lyon 1, Inst Camille Jordan, CNRS UMR 5208, F-69622 Villeurbanne, France
[2] Univ Oxford, Dept Comp Sci, Wolfson Bldg,Parks Rd, Oxford OX1 3QD, England
[3] TU Wien, Inst Diskrete Math & Geometrie, Wiedner Hauptstr 8-10, A-1040 Vienna, Austria
来源：
ERGODIC THEORY AND DYNAMICAL SYSTEMS | 2024年 / 44卷 / 09期
基金：
奥地利科学基金会; 英国科研创新办公室;
关键词：
generalized polynomial; Sturmian word; subword complexity; nilsequence; Mobius orthogonality; THUE-MORSE SEQUENCE; MOBIUS FUNCTION; NORMALITY; FULFILL;
D O I：
10.1017/etds.2023.112
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study bracket words, which are a far-reaching generalization of Sturmian words, along Hardy field sequences, which are a far-reaching generalization of Piatetski-Shapiro sequences $\lfloor n<^>c \rfloor $. We show that sequences thus obtained are deterministic (that is, they have subexponential subword complexity) and satisfy Sarnak's conjecture.
引用
收藏
页码：2621 / 2648
页数：28
相关论文
共 7 条
1