The periodic-structure conjecture for most frequent subwords
Statement
Let be a word, and write for its -fold concatenation. A subword is most frequent if it maximizes the number of occurrences in . Periodic-structure conjecture. There is a word such that, for every sufficiently large , some most frequent subword of has the form
where and have lengths bounded by .
If true, this would reduce the asymptotic analysis of most frequent subwords in periodic words to powers of a fixed word, potentially yielding improved bounds for the subword-entropy constants. The claim is supported by examples and is presented as open.
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.