For power-free words, does the reachability property hold for every prefix u and suffix v occurring infinitely often; does every curling-number sequence eventually reach 1;…
Statement
For power-free words, does the reachability property hold for every prefix u and suffix v occurring infinitely often; does every curling-number sequence eventually reach 1; and does the lexicographically least infinite word over N avoiding 5/2-powers use only three letters?
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.