The discrepancy of the lex-least de Bruijn sequence

We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the maximum (absolute) difference between the number of ones and the number of zeros in any initial segment of the sequence. We show that the answer is (2n log n/n). Key words: De Bruijn sequence, Ford sequence, discrepancy, greedy algorithm 2000 MSC: 05A16

• Type: Journal
• Year: 2010
• Where: DM
• Authors: Joshua Cooper, Christine E. Heitsch
• Keywords: Bruijn Sequence, De Bruijn Sequence, DM 2010, Initial Segment