Conjecture on the string attractor size of simple-Parry automatic sequences
Statement
Let be a finite word satisfying condition (WH), and assume that one of the equivalent assertions in Proposition 4 holds. Let be the associated simple-Parry automatic sequence, let be the length parameter from that proposition, and let denote the sequence of lengths associated with . The function is the minimum size of a string attractor of the length- prefix of . String-attractor-size conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.