Fixed points avoiding abelian k-powers

DOI10.1016/J.JCTA.2012.01.006zbMATH Open1298.68203arXiv1106.1842OpenAlexW2017325803MaRDI QIDQ412180FDOQ412180

Authors: James D. Currie, Narad Rampersad 

Publication date: 4 May 2012

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

Abstract: We show that the problem of whether the fixed point of a morphism avoids Abelian $k$-powers is decidable under rather general conditions

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

Recommendations

• On abelian 2-avoidable binary patterns
• ON ABELIAN POWER-FREE MORPHISMS
• On \(k\)-abelian avoidability
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms

zbMATH Keywords

combinatorics on wordspatternsabelian repetitions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Templates for the \(k\)-binomial complexity of the Tribonacci word
• Avoiding or Limiting Regularities in Words
• Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
• On some generalizations of abelian power avoidability
• Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
• Relations on words
• Abelian combinatorics on words: a survey

This page was built for publication: Fixed points avoiding abelian \(k\)-powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412180)