Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918151735738368 |
|---|---|
| author | Machacek, John |
| author_facet | Machacek, John |
| contents | We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to recognize Sturmian words in general. Within our framework, we establish square avoidance results for the ternary squarefree Thue--Morse word $\mathbf{vtm}$. These results go beyond the usual squarefreeness of $\mathbf{vtm}$ and are proved using Walnut. Lastly, we establish a group action factor complexity formula for $\mathbf{vtm}$ that is expressed in terms of the abelian complexity of the period doubling word $\mathbf{pd}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_26613 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$ Machacek, John Combinatorics Formal Languages and Automata Theory 68R15 We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to recognize Sturmian words in general. Within our framework, we establish square avoidance results for the ternary squarefree Thue--Morse word $\mathbf{vtm}$. These results go beyond the usual squarefreeness of $\mathbf{vtm}$ and are proved using Walnut. Lastly, we establish a group action factor complexity formula for $\mathbf{vtm}$ that is expressed in terms of the abelian complexity of the period doubling word $\mathbf{pd}$. |
| title | Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$ |
| topic | Combinatorics Formal Languages and Automata Theory 68R15 |
| url | https://arxiv.org/abs/2509.26613 |