Abelian repetitions in partial words

DOI10.1016/j.aam.2011.06.006zbMath1231.68187OpenAlexW2013205074MaRDI QIDQ651057

Sean Simmons, Dimin Xu, Francine Blanchet-Sadri

Publication date: 8 December 2011

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

Full work available at URL: https://doi.org/10.1016/j.aam.2011.06.006

zbMATH Keywords

morphismspattern avoidancecombinatorics on wordspartial wordsParikh vectorsabelian powers

Mathematics Subject Classification ID

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

Related Items

Abelian-primitive partial words, Avoiding abelian powers cyclically, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of binary words avoiding Abelian fourth powers grows exponentially
• A powerful abelian square-free substitution over 4 letters
• A cyclic binary morphism avoiding abelian fourth powers
• A generalization of Thue freeness for partial words
• Strongly non-repetitive sequences and progression-free sets
• On Abelian squares and substitutions
• Partial words and a theorem of Fine and Wilf
• On the number of Abelian square-free words on four letters
• Freeness of partial words
• Characterization of the repetitive commutative semigroups
• Abelian Square-Free Partial Words
• BLOCKING SETS OF TERMS
• Avoiding Abelian Powers in Partial Words
• Abelian squares are avoidable on 4 letters
• Algorithmic Combinatorics on Partial Words
• Second Preimage Attacks on Dithered Hash Functions
• Partially abelian squarefree words