Maximal complexity conjecture for classical constants
Statement
Let be one of the classical constants , , , , or . For an integral base , write for the number of distinct blocks of length occurring in the base- expansion of .
Maximal complexity conjecture. The complexity of satisfies
for every positive integer and every base .
This is the maximal possible subword complexity and would follow from normality of the relevant expansions. The conjecture is presented as widely believed, but no resolution is given here.
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.