Type: Article
Publication Date: 2023-12-14
Citations: 0
DOI: https://doi.org/10.1017/etds.2023.112
Abstract 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.
Action | Title | Year | Authors |
---|