Bracket words along Hardy field sequences
Number Theory
2024-11-20 v1 Combinatorics
Dynamical Systems
Abstract
We study bracket words, which are a far-reaching generalisation of Sturmian words, along Hardy field sequences, which are a far-reaching generalisation of Piatetski--Shapiro sequences . We show that thus obtained sequences are deterministic (i.e., they have sub-exponential subword complexity) and satisfy Sarnak's conjecture.
Cite
@article{arxiv.2302.09626,
title = {Bracket words along Hardy field sequences},
author = {Jakub Konieczny and Clemens Müllner},
journal= {arXiv preprint arXiv:2302.09626},
year = {2024}
}
Comments
26 pages, comments welcome