ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α\alpha be one of the classical constants π\pi, ee, log⁡2\log 2, ζ(3)\zeta(3), or 2\sqrt 2. For an integral base b≥2b\geq 2, write p(α,b,m)p(\alpha,b,m) for the number of distinct blocks of length mm occurring in the base-bb expansion of α\alpha.

Maximal complexity conjecture. The complexity of α\alpha satisfies

p(α,b,m)=bm,p(\alpha,b,m)=b^m,

for every positive integer mm and every base b≥2b\geq 2.

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 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.