Existence of the asymptotic duplication-distance limit
Statement
For an alphabet with letters, let be the minimum number of single square reductions needed to turn a word into a square-free word, and let be the maximum value of over words of length . Limit-existence conjecture. For every , the limit
exists. For , this limit is known to exist and is bounded between and ; existence for larger alphabets, including , remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.