ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T=(tn)n≥0T=(t_n)_{n\ge0} be the steering word considered in the paper, and let pT(k)p_T(k) denote the number of distinct factors of length kk occurring in TT. Exact complexity conjecture.

pT(k)=3 k+1−2 k+1for every k≥1.p_T(k)=3^{\,k+1}-2^{\,k+1}\quad\text{for every }k\ge1.

The formula agrees with the measured complexity profile for small kk and predicts the exact number of factors at every length. The paper presents it as conjectural; in particular, the available computation is finite and does not establish the assertion for all kk.

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.