2000 character limit reached
A small morphism giving Abelian repetition threshold less than 2
Published 27 Dec 2023 in math.CO and cs.FL | (2312.16665v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.