The conjecture for extensions beginning with n1 and n2
Let denote the lexicographically least infinite word on beginning with whose only square factors are contained in the prefix . The conjecture for extensions beginning with and . For every integer ,
These identities would extend the known formulas for prefixes and with letters at least , and would describe the least square-free extensions of the mixed prefixes and .
References
Primary source
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle, John López, Mauditra Matin, Daniel Roebuck, Eric Rowland, Noam Scully and Juliet Whidden, “The lexicographically least square-free word with a given prefix”, arXiv:2210.00508 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.