ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k≥2k \geq 2, let min⁡Ssw(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

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

is increasing for n≥Nn \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.

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.