The strict lower-bound conjecture for binary subword entropy
Statement
Let denote the asymptotic binary subword-entropy constant, and let be the logarithm to base . Strict lower-bound conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.