Asymptotic conjugation-invariance conjecture for regular word values
Asymptotic conjugation-invariance conjecture for regular word values
Let be the symmetric group and let be the free group on generators. For a word with constants , let be the distribution of its word values, let be the conjugation symmetrization of a probability measure on , and let be the Kantorovich--Rubinstein metric induced by normalized Hamming distance. A word with constants is regular if it is not conjugate to an element of and every critical constant of is fixed point free. Asymptotic conjugation-invariance conjecture. If are regular words with constants of bounded length, then
The question is whether symmetrization is necessary for asymptotic conjugation-invariance; the source states this conjecture after proving a bound for the symmetrized distribution.
Sources & referencesView supporting material
Primary source
Vadim Alekseev, Jakob Schneider and Andreas Thom, “On the asymptotic equidistribution of word values in symmetric groups”, arXiv:2507.13928 (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.