2000 character limit reached
Cubefree words with many squares
Published 19 Nov 2008 in math.CO and cs.FL | (0811.3233v1)
Abstract: We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
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.