Lex-Least De Bruijn序列的离散性
The Discrepancy of the Lex-Least De Bruijn Sequence
摘要：
我们回答了R. L.格雷厄姆：字典最小二进制de Bruijn序列的矛盾是什么？这里，“差异”指的是序列的任何初始段中1的数目与0的数目之间的最大（绝对）差。我们证明了答案是$Θ(2^n \log n/n)$。
英文摘要：
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 $Θ(2^n \log n/n)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
