ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L2L_2 denote the asymptotic binary subword-entropy constant, and let log⁡2\log_2 be the logarithm to base 22. Strict lower-bound conjecture.

L2>log⁡2(3/2).L_2 > \log_2(3/2).

This conjecture is supported by exhaustive computations suggesting that the universal lower bound is not tight, although the available data are limited to small word lengths and the claim remains 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.