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.

中文翻译：

---

沿着 Hardy 域序列的括号单词

我们沿着 Hardy 域序列（Piatetski-Shapiro 序列的深远推广）研究括号词（Sturmian 词的深远推广） $\lfloor n^c \rfloor $ 。我们证明，由此获得的序列是确定性的（即，它们具有次指数子字复杂度）并满足 Sarnak 的猜想。