ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ln{\mathcal L}_n be the lexicographically least binary order-nn de Bruijn sequence, formed by concatenating all Lyndon words of length dividing nn in lexicographic order. For a word ww, define its discrepancy by

disc⁡(w)=max⁡M∣∑k=0M(−1)wk∣.\operatorname{disc}(w)=\max_M\left|\sum_{k=0}^M(-1)^{w_k}\right|.

Discrepancy asymptotic constant conjecture. There is some constant CC such that

lim⁡n→∞ndisc⁡(Ln)2nlog⁡n=C.\lim_{n\rightarrow\infty}\frac{n\operatorname{disc}({\mathcal L}_n)}{2^n\log n}=C.

The preceding theorem establishes the order of magnitude disc⁡(Ln)=Θ(2nlog⁡n/n){\operatorname{disc}({\mathcal L}_n)}=\Theta(2^n\log n/n); the conjecture asserts that the normalized discrepancy has a limiting constant, strengthening that asymptotic estimate.

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.