On some generalizations of abelian power avoidability

DOI10.1016/J.TCS.2015.07.026zbMATH Open1330.68242OpenAlexW872950216MaRDI QIDQ496047FDOQ496047

Authors: Michaël Rao 

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.026

Recommendations

• On \(k\)-abelian avoidability
• ON ABELIAN POWER-FREE MORPHISMS
• Fixed points avoiding abelian \(k\)-powers
• scientific article; zbMATH DE number 3040735
• scientific article; zbMATH DE number 3099443
• Power residues on Abelian varieties
• On a Boolean power of a torsion free Abelian group
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• On the power of generalized Mod-classes
• An Application of the Power Residue Theory to Some Abelian Functions

zbMATH Keywords

morphism\(k\)-abelian equivalence, square-free wordsavoidance of repetitionscube-free words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• How many squares must a binary sequence contain?
• Some unsolved problems
• Strongly non-repetitive sequences and progression-free sets
• Title not available (Why is that?)
• Abelian squares are avoidable on 4 letters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Problems in between words and abelian words: \(k\)-abelian avoidability
• Avoiding three consecutive blocks of the same size and same sum
• Local squares, periodicity and finite automata
• Generalized Parikh mappings and homomorphisms
• Existence of an infinite ternary 64-abelian square-free word
• 5-abelian cubes are avoidable on binary alphabets
• On a generalization of abelian equivalence and complexity of infinite words
• 3-abelian cubes are avoidable on binary alphabets
• On nonrepetitive sequences
• Last cases of Dejean's conjecture
• On Abelian squares and substitutions
• Title not available (Why is that?)
• Fixed points avoiding abelian \(k\)-powers
• On the number of Abelian square-free words on four letters
• ON ABELIAN POWER-FREE MORPHISMS
• On unavoidability of \(k\)-abelian squares in pure morphic words
• Avoidability of long \(k\)-abelian repetitions

Cited In (25)

• On unavoidability of \(k\)-abelian squares in pure morphic words
• Avoidability of long \(k\)-abelian repetitions
• Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
• Strongly \(k\)-abelian repetitions
• Avoiding 2-binomial squares and cubes
• Avoiding or limiting regularities in words
• Title not available (Why is that?)
• Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
• On growth and fluctuation of \(k\)-abelian complexity
• 3-abelian cubes are avoidable on binary alphabets
• 5-abelian cubes are avoidable on binary alphabets
• A compactness property of the \(k\)-abelian monoids
• Abelian squares are avoidable on 4 letters
• Problems in between words and abelian words: \(k\)-abelian avoidability
• Crucial Words for Abelian Powers
• On shortest crucial words avoiding abelian powers
• Relations on words
• Binary patterns in binary cube-free words: avoidability and growth
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Avoiding abelian powers cyclically
• Title not available (Why is that?)
• On growth and fluctuation of \(k\)-abelian complexity
• Avoidability of Additive Cubes over Alphabets of Four Numbers
• Crucial abelian \(k\)-power-free words
• Abelian combinatorics on words: a survey

This page was built for publication: On some generalizations of abelian power avoidability

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