There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)

DOI10.1016/J.DAM.2009.02.010zbMath1211.05006arXiv0812.4470OpenAlexW2012996826MaRDI QIDQ967293

Narad Rampersad, James D. Currie

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.4470

zbMATH Keywords

uniform morphismcubefree word\(n\)-power-free morphismcubefree morphism

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (3)

Reduction in non-(k+ 1)-power-free morphisms ⋮ Infinite ternary square-free words concatenated from permutations of a single word ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4

Cites Work

• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Avoidable patterns in strings of symbols
• Sharp characterizations of squarefree morphisms
• A characterization of overlap-free morphisms
• There exist binary circular \(5/2^+\) power free words of every length
• Some results on \(k\)-power-free morphisms
• On cube-free \(\omega\)-words generated by binary morphisms
• Uniformly growing k-th power-free homomorphisms
• Some non finitely generated monoids of repetition-free endomorphisms.
• Overlap-free morphisms and finite test-sets
• Characterization of test-sets for overlap-free morphisms
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• The structure of the set of cube-free $ Z$-words in a two-letter alphabet
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• Automatic Sequences

This page was built for publication: There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)