ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ww be a word, and write wmw^m for its mm-fold concatenation. A subword is most frequent if it maximizes the number of occurrences in wmw^m. Periodic-structure conjecture. There is a word vv such that, for every sufficiently large mm, some most frequent subword of wmw^m has the form

u⋅vr⋅u′,u \cdot v^r \cdot u',

where uu and u′u' have lengths bounded by ∣v∣|v|.

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 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.