Second auto-correlation separation conjecture for binary words

Less than 1 year old · traced to

Let w,w′w,w' be two words, and let c~(w)\tilde{c}(w) denote the second auto-correlation constant defined by the asymptotic second moment of the number of leaves associated with ww. The paper establishes that differing values of c~(w)\tilde{c}(w) likewise imply positive limiting-inferior total variation distance. Second auto-correlation separation conjecture. If ww and w′w' are non-isomorphic words, then

c~(w)≠c~(w′).\tilde{c}(w)\neq\tilde{c}(w').

This is the analogous conjecture for the second-moment constants and is presented as open.

References

Primary source

Guillaume Chapuy and Guillem Perarnau, “Composition of random functions and word reconstruction”, arXiv:2603.28936 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.