The regular-word existence and uniqueness conjecture for generalized Thue–Morse sequences
Statement
Let and let be the length of a word over a two-letter alphabet. An -regular word is a word satisfying the corresponding regularity condition, and denotes the set of words representing Prouhet–Tarry–Escott solutions with these parameters. Regular-word existence and uniqueness conjecture. On a two-letter alphabet, there are -regular words of length if and only if
Moreover, contains just one word: the initial segment of the Thue–Morse sequence of length . The preceding theorem establishes existence whenever with ; the conjectural content is the converse for all and the asserted uniqueness of the corresponding Prouhet–Tarry–Escott word.
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.