Infinite ternary square-free words concatenated from permutations of a single word
From MaRDI portal
Publication:390906
DOI10.1016/J.TCS.2013.03.001zbMATH Open1291.68302arXiv1207.3445OpenAlexW2964101747MaRDI QIDQ390906FDOQ390906
Authors: James D. Currie
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We answer a question of Harju: An infinite square-free ternary word with an -stem factorization exists for any . We show that there are uniform ternary morphisms of length for every . This resolves almost completely a problem of the author and Rampersad.
Full work available at URL: https://arxiv.org/abs/1207.3445
Recommendations
- More on Square-free Words Obtained from Prefixes by Permutations
- Square-free words obtained from prefixes by permutations
- On square-free arithmetic progressions in infinite words
- Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words
- Square-free words with square-free self-shuffles
Cites Work
- Title not available (Why is that?)
- Sharp characterizations of squarefree morphisms
- Square-free words obtained from prefixes by permutations
- Square-free shuffles of words
- Abelian squares are avoidable on 4 letters
- Title not available (Why is that?)
- There exist binary circular \(5/2^+\) power free words of every length
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
Cited In (8)
- Some further results on squarefree arithmetic progressions in infinite words
- On square-free arithmetic progressions in infinite words
- More on Square-free Words Obtained from Prefixes by Permutations
- Square-free words with square-free self-shuffles
- Square-free words obtained from prefixes by permutations
- Square-free shuffles of words
- Finite test sets for morphisms that are squarefree on some of Thue's squarefree ternary words
- Infinite words containing squares at every position
This page was built for publication: Infinite ternary square-free words concatenated from permutations of a single word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390906)