Existence of a nonrepetitive palindrome-free sequence avoiding two subsequences
Statement
Let an infinite sequence be a sequence whose terms are drawn from the four-letter alphabet . A sequence is nonrepetitive if it contains no contiguous block of the form for a nonempty finite word , and palindrome-free if it contains no nonempty palindromic contiguous block. It avoids the subsequences and if neither of these occurs as a subsequence.
Sequence existence conjecture. There exists an infinite sequence on four letters, and such that the sequence is nonrepetitive, palindrome-free and avoids the subsequences and .
The paper states that this conjecture was recently confirmed by Kozik, so the existence claim is resolved.
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.