ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let x(00)x^{(00)} be the fixed point of the Thue–Morse two-block substitution, and let p(00)(n)p^{(00)}(n) denote its subword complexity, namely the number of distinct factors of length nn. Quadratic subword-complexity conjecture. There is a constant c>0c>0 such that

p(00)(n)≥cn2p^{(00)}(n)\geq cn^2

for all n=1,2,…n=1,2,\dots. The displayed initial values of the complexity function support quadratic growth, but no proof is supplied in the source.

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.