Avoiding 2-binomial squares and cubes

DOI10.1016/j.tcs.2015.01.029zbMath1325.68173arXiv1310.4743OpenAlexW2116342534MaRDI QIDQ2257294

Michel Rigo, Michaël Rao, Pavel Salimov

Publication date: 24 February 2015

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

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

zbMATH Keywords

binomial coefficientcombinatorics on wordssquarefree wordavoidancebinomial equivalencecubefree word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Equations over the \(k\)-binomial monoids ⋮ Abelian combinatorics on words: a survey ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ Avoiding or Limiting Regularities in Words ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ Relations on words ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word ⋮ GAPS IN THE THUE–MORSE WORD

Cites Work

• On a generalization of abelian equivalence and complexity of infinite words
• On some generalizations of abelian power avoidability
• Strongly non-repetitive sequences and progression-free sets
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
• ON ABELIAN POWER-FREE MORPHISMS
• Abelian squares are avoidable on 4 letters
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Avoiding 2-binomial squares and cubes