The eventual monotonicity conjecture for minimal subword entropy

For k2k \geq 2, let minSsw(k)(n)\min S_{\mathrm{sw}}^{(k)}(n) denote the minimal subword entropy among words of length nn. Eventual monotonicity conjecture. There is a value NN such that the function

minSsw(k)(n)n\frac{\min S_{\mathrm{sw}}^{(k)}(n)}{n}

is increasing for nNn \geq N.

The function is known experimentally not to be increasing for all nn, so the conjecture asserts only eventual monotonicity. Its general status is open.

Sources & referencesView supporting material

Primary source

Wenjie Fang, “Maximal number of subword occurrences in a word”, arXiv:2406.02971 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.