ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers k≤nk\leq n, let Uk(n)U_k(n) be the minimum length of a sequence of independent lazy transpositions whose product maps the elements 1,…,k1,\dots,k uniformly to the n(n−1)…(n−k+1)n(n-1)\dots(n-k+1) possible ordered kk-tuples; such a sequence is called a (k,n)(k,n)-shuffle. Groenland, Johnston, Radcliffe and Scott's conjecture. For all n≥2n\geq 2,

U2(n)=2n−3.U_2(n)=2n-3.

The general construction gives Uk(n)≤kn−(k+12)U_k(n)\leq kn-\binom{k+1}{2}, and the cited work improves this bound for every k≥3k\geq3. The case k=2k=2 remains the conjectured sharp case, and proving it would establish that the displayed upper bound cannot be improved for two-element shuffles.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.