Asymptotic constant for the discrepancy of the lex-least de Bruijn sequence
Statement
Let be the lexicographically least binary order- de Bruijn sequence, formed by concatenating all Lyndon words of length dividing in lexicographic order. For a word , define its discrepancy by
Discrepancy asymptotic constant conjecture. There is some constant such that
The preceding theorem establishes the order of magnitude ; the conjecture asserts that the normalized discrepancy has a limiting constant, strengthening that asymptotic estimate.
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.