The cutoff conjectures for multi-stack and restricted random-to-random shuffles

From papers

Let dd, μ\mu, γ\gamma, and qq be as in the paper's shuffle-chain theorem. Consider the multi-stack random-to-random shuffle chain Xshuf\mathbf{X}^{\operatorname{shuf}} and the restricted random-to-random shuffle chain Xres-shuf\mathbf{X}^{\operatorname{res-shuf}}.

Multi-stack and restricted shuffle cutoff conjecture. Both chains exhibit cutoff, with the multi-stack chain around time

Tnlognmax{12γ,34},T\coloneqq n\log n\cdot\max\left\{\frac{1}{2\gamma},\frac{3}{4}\right\},

and the restricted chain around time

Tnlognmax{12γ,34q}.T\coloneqq n\log n\cdot\max\left\{\frac{1}{2\gamma},\frac{3}{4q}\right\}.

The conjecture is supported by the proof strategy in the paper and by the known 34nlogn\frac{3}{4}n\log n 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

No solutions have been posted yet.