ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DBmax(n)\mathcal{DB}_{max}(n) denote the de Bruijn sequence of order nn defined in the source, and let the discrepancy of a binary sequence be the maximum, over all prefixes, of the absolute difference between the numbers of 11s and 00s.

Maximum discrepancy conjecture. The sequence DBmax(n)\mathcal{DB}_{max}(n) has discrepancy equal to

(n−1⌊n/2⌋)+⌊n/2⌋,{n-1 \choose \lfloor n/2 \rfloor}+\lfloor n/2\rfloor,

and this is the maximum possible discrepancy over all de Bruijn sequences of order nn.

The claim is motivated by an established lower bound and exact computations for 10≤n≤2510\leq n\leq 25; the source does not provide a proof of equality or of global maximality.

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.