The cutoff conjectures for multi-stack and restricted random-to-random shuffles
The cutoff conjectures for multi-stack and restricted random-to-random shuffles
Let , , , and be as in the paper's shuffle-chain theorem. Consider the multi-stack random-to-random shuffle chain and the restricted random-to-random shuffle chain .
Multi-stack and restricted shuffle cutoff conjecture. Both chains exhibit cutoff, with the multi-stack chain around time
and the restricted chain around time
The conjecture is supported by the proof strategy in the paper and by the known cutoff for random-to-random shuffling, but the two stated generalisations remain open.
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
Ritesh Goenka, Jonathan Hermon and Dominik Schmid, “Cutoff for generalised Bernoulli-Laplace urn models”, arXiv:2511.10630 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.