Avoidability of long 𝑘-abelian repetitions

DOI10.1090/mcom/3085zbMath1359.68244arXiv1507.02581OpenAlexW2963924785MaRDI QIDQ5741503

Michaël Rao, Matthieu Rosenfeld

Publication date: 25 July 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

abelian repetition\(k\)-abelian equivalenceMäkelä conjecture

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Abelian combinatorics on words: a survey, A compactness property of the \(k\)-abelian monoids, Regularity of k-Abelian Equivalence Classes of Fixed Cardinality, Avoiding or Limiting Regularities in Words, On some generalizations of abelian power avoidability, Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$, k-Abelian Equivalence and Rationality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• On some generalizations of abelian power avoidability
• Some unsolved problems
• Strongly non-repetitive sequences and progression-free sets
• How many squares must a binary sequence contain?
• On the number of Abelian square-free words on four letters
• On nonrepetitive sequences
• ON ABELIAN POWER-FREE MORPHISMS
• Abelian squares are avoidable on 4 letters