ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let cc be a finite word satisfying condition (WH), and assume that one of the equivalent assertions in Proposition 4 holds. Let u\mathbf{u} be the associated simple-Parry automatic sequence, let kk be the length parameter from that proposition, and let UiU_i denote the sequence of lengths associated with cc. The function su(m)s_{\mathbf{u}}(m) is the minimum size of a string attractor of the length-mm prefix of u\mathbf{u}. String-attractor-size conjecture.

su(m)={i+1,if m∈[Ui,Ui+1) with 0≤i≤k−2,k,if m≥Uk−1.s_{\mathbf{u}}(m)=\begin{cases} i+1, & \text{if }m\in[U_i,U_{i+1})\text{ with }0\leq i\leq k-2,\\ k, & \text{if }m\geq U_{k-1}. \end{cases}

This conjecture predicts the exact minimal string-attractor size for the prefixes of the sequences under consideration, extending the known behavior of the period-doubling word and the bounds established earlier in the paper. Its status is not resolved in the supplied 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.