2003/04/29 by Jeffrey Shallit, Shallit, Jeffrey
Computer Science · Mathematics · #68R15 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:68R15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0304476
arxiv created 2003/04/29 · openalex publication_date 2003/04/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where `4' is replaced by any integer. This results in an interesting and subtle hierarchy.