Positive-density conjecture for words avoiding forbidden signatures
Statement
Let be a finite-length word that contains no as a subsequence of consecutive symbols. Positive-density conjecture. The limit
exists and is strictly positive. This is the formal version of the paper’s stronger density claim for admissible words. Its status is not resolved in the supplied material.
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.