Fixed points avoiding abelian \(k\)-powers

DOI10.1016/j.jcta.2012.01.006zbMath1298.68203arXiv1106.1842OpenAlexW2017325803MaRDI QIDQ412180

Narad Rampersad, James D. Currie

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

patternscombinatorics on wordsabelian repetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

Abelian combinatorics on words: a survey ⋮ Avoiding or Limiting Regularities in Words ⋮ On some generalizations of abelian power avoidability ⋮ Relations on words ⋮ Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On stabilizers of infinite words
• A cyclic binary morphism avoiding abelian fourth powers
• Strongly non-repetitive sequences and progression-free sets
• On Abelian squares and substitutions
• On cube-free \(\omega\)-words generated by binary morphisms
• Overlap-free morphisms and finite test-sets
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• Avoiding Three Consecutive Blocks of the Same Size and Same Sum
• Matrix Analysis
• If a DOL language is k-power free then it is circular
• Abelian squares are avoidable on 4 letters