ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A de Bruijn sequence of order nn is a cyclic binary sequence in which every binary word of length nn occurs exactly once; the Pref-opposite algorithm is the construction specified in the source. The discrepancy of a binary sequence is the maximum, over all prefixes, of the absolute difference between the numbers of 11s and 00s.

Quadratic discrepancy conjecture. The de Bruijn sequence constructed by the Pref-opposite algorithm has discrepancy Θ(n2)\Theta(n^2).

The conjecture is supported by computations for 10≤n≤3010\leq n\leq 30 and by an observed connection with OEIS sequence A033638, whose shifted formula gives the displayed experimental values; no proof or resolution is supplied 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.