Groenland, Johnston, Radcliffe and Scott's conjecture for two-element shuffles
Statement
For integers , let be the minimum length of a sequence of independent lazy transpositions whose product maps the elements uniformly to the possible ordered -tuples; such a sequence is called a -shuffle. Groenland, Johnston, Radcliffe and Scott's conjecture. For all ,
The general construction gives , and the cited work improves this bound for every . The case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.