Some further results on squarefree arithmetic progressions in infinite words
From MaRDI portal
Publication:2333815
DOI10.1016/j.tcs.2019.10.006zbMath1436.68276arXiv1901.06351OpenAlexW2980389992WikidataQ127018839 ScholiaQ127018839MaRDI QIDQ2333815
Pascal Ochem, James D. Currie, Tero J.Harju, Narad Rampersad
Publication date: 13 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06351
Related Items (6)
Unnamed Item ⋮ Squarefree words with interior disposable factors ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ How far away must forced letters be so that squares are still avoidable? ⋮ Ostrowski-automatic sequences: theory and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite ternary square-free words concatenated from permutations of a single word
- Multidimensional unrepetitive configurations
- Sharp characterizations of squarefree morphisms
- Non-repetitive tilings
- On square-free arithmetic progressions in infinite words
- Uniformly growing k-th power-free homomorphisms
- Words avoiding repetitions in arithmetic progressions
- Unending chess, symbolic dynamics and a problem in semi-groups
This page was built for publication: Some further results on squarefree arithmetic progressions in infinite words