2023/12/27 by James D. Currie, Narad Rampersad, Currie, James D. +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #68R15 #Coding theory and cryptography #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2312.16665
openalex publication_date 2023/12/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism (length 13) over an 8-letter alphabet yielding an Abelian repetition threshold less than 1.8.