Minimum critical exponent conjecture for ternary words of complexity at most 2n+1
Statement
Let be the ternary infinite word defined earlier in the paper, and let the subword complexity of an infinite word be the number of its distinct factors of each length. For a word, its critical exponent is the supremum of the exponents of its finite factors. Minimum critical exponent conjecture. Among all ternary words with subword complexity bounded above by , the word has the lowest possible critical exponent. This is an extremal conjecture relating factor complexity to power avoidance; the source gives no resolution.
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.