Second auto-correlation separation conjecture for binary words
Second auto-correlation separation conjecture for binary words
Let be two words, and let denote the second auto-correlation constant defined by the asymptotic second moment of the number of leaves associated with . The paper establishes that differing values of likewise imply positive limiting-inferior total variation distance. Second auto-correlation separation conjecture. If and are non-isomorphic words, then
This is the analogous conjecture for the second-moment constants and is presented as open.
Sources & referencesView supporting material
Primary source
Guillaume Chapuy and Guillem Perarnau, “Composition of random functions and word reconstruction”, arXiv:2603.28936 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.