2 problems

0 votes0 replies1 view
Minimum critical exponent conjecture for ternary words of complexity at most $2n+1$
Let ${\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…
Conjectureopencombinatorics-on-words power-avoidance subword-complexityarXiv posted 2 days ago
0 votes0 replies0 views
Minimum complexity conjecture for square-free ternary words
Let ${\mathbf T}$ be the ternary Thue word, the fixed point of the morphism $0\mapsto012$ , $1\mapsto02$ , and $2\mapsto1$ . A ternary infinite word is square-free if it contains no f…
Conjectureopencombinatorics-on-words power-avoidance subword-complexityarXiv posted 2 days ago

Minimum critical exponent conjecture for ternary words of complexity at most 2n+12n+12n+1