Cutoff conjecture for the Burnside process

From papers

Fix k2k\ge 2, and for each nn let KnK_n be the Burnside process on (Ckn,Sn)(C_k^n,S_n). Consider starting states whose limiting empirical distribution on CkC_k assigns a positive proportion to at least two different values. Burnside-process cutoff conjecture. The chain KnK_n has cutoff in both 1\ell^1 and 2\ell^2 when started from such states. The paper proves that n/lognn/\log n steps are necessary for 2\ell^2 mixing from many such starting states, but lacks the spectral information needed for matching upper bounds; the conjecture asserts the resulting cutoff in both norms.

Progress summary

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

Sources & referencesView supporting material

Primary source

Persi Diaconis, Andrew Lin and Arun Ram, “A curiously slowly mixing Markov chain”, arXiv:2511.01245 (2025).

Solutions 0

No solutions have been posted yet.