Maximum discrepancy conjecture for the de Bruijn sequence DB_max
Statement
Let denote the de Bruijn sequence of order 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 s and s.
Maximum discrepancy conjecture. The sequence has discrepancy equal to
and this is the maximum possible discrepancy over all de Bruijn sequences of order .
The claim is motivated by an established lower bound and exact computations for ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.