论文信息 - The discrepancy of the lex-least de Bruijn sequence

The discrepancy of the lex-least de Bruijn sequence

We answer the following question: 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 @Q(2^nlogn/n).

Joshua N. Cooper | Christine E. Heitsch

[1] N. Alon,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[2] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[3] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.

[4] M. Martin. A problem in arrangements , 1934 .

[5] Richard M. Karp,et al. Universal DNA Tag Systems: A Combinatorial Design Scheme , 2000, J. Comput. Biol..

[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7] R. Graham,et al. Handbook of Combinatorics , 1995 .

[8] Yuejiang Huang. A New Algorithm for the Generation of Binary de Bruijn Sequences , 1990, J. Algorithms.

[9] Igor E. Shparlinski,et al. Character sums and nonlinear recurrence sequences , 2006, Discret. Math..

[10] J. H. van Lint,et al. A Course in Combinatorics: Trees , 2001 .

[11] Anthony A. Philippakis,et al. Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments , 2007, RECOMB.

[12] A. Odlyzko. Asymptotic enumeration methods , 1996 .

[13] V. Ipatov. Spread Spectrum and CDMA: Principles and Applications , 2005 .

[14] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[15] Solomon W. Golomb,et al. Shift Register Sequences , 1981 .