There are exponentially many ternary words that avoid abelian cubes

2004/03/23 by Narad Rampersad, Rampersad, Narad
Computer Science · Engineering · Mathematics · #68R15 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:68R15 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/0403391

This paper has been withdrawn

openalex publication_date 2004/03/23 · arxiv created 2004/03/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the author due to an error in the proof of Theorem 2.

Related

• Observations and Problems on k-abelian avoidability
• A note on avoidable words in squarefree ternary words
• Avoidability of long k-abelian repetitions
• On Avoiding Sufficiently Long Abelian Squares
• Abelian-square factors and binary words