ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G{\mathbf G} 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 2n+12n+1, the word G{\mathbf G} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.