Bracket words along Hardy field sequences
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909395089096704 |
|---|---|
| author | Konieczny, Jakub Müllner, Clemens |
| author_facet | Konieczny, Jakub Müllner, Clemens |
| contents | 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 $\lfloor n^c \rfloor$. We show that thus obtained sequences are deterministic (i.e., they have sub-exponential subword complexity) and satisfy Sarnak's conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_09626 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Bracket words along Hardy field sequences Konieczny, Jakub Müllner, Clemens Number Theory Combinatorics Dynamical Systems 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 $\lfloor n^c \rfloor$. We show that thus obtained sequences are deterministic (i.e., they have sub-exponential subword complexity) and satisfy Sarnak's conjecture. |
| title | Bracket words along Hardy field sequences |
| topic | Number Theory Combinatorics Dynamical Systems |
| url | https://arxiv.org/abs/2302.09626 |