Fixed points avoiding abelian k-powers

DOI10.1016/J.JCTA.2012.01.006MaRDI QIDQ412180zbMATH OpenOpenAlexFDO

Authors James D. Currie, Narad Rampersad

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

combinatorics on wordspatternsabelian repetitions

Mathematics Subject Classification ID

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

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

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

Cites work

• scientific article; zbMATH DE number 2186883 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3661611 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3375509 (Why is no real title available?)
• A cyclic binary morphism avoiding abelian fourth powers
• Abelian squares are avoidable on 4 letters
• Avoiding three consecutive blocks of the same size and same sum
• CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS
• If a DOL language is k-power free then it is circular
• Matrix Analysis
• On Abelian squares and substitutions
• On cube-free \(\omega\)-words generated by binary morphisms
• On stabilizers of infinite words
• Overlap-free morphisms and finite test-sets
• Strongly non-repetitive sequences and progression-free sets

Cited in

(7)

• Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
• Avoiding or limiting regularities in words
• On some generalizations of abelian power avoidability
• Templates for the \(k\)-binomial complexity of the Tribonacci word
• Abelian combinatorics on words: a survey
• Relations on words
• Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)

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)