ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a deck with nn cards of each type, and let λD\lambda_D denote the expected number of steps to absorption for the random card-shuffling process started from DD. As n→∞n\to\infty, quadratic upper-bound conjecture. There is an absolute constant C≤2C\leq 2 such that

max⁡{λD ⁣:D any deck}≤Cn2+o(n2).\max\{\lambda_D\colon D\text{ any deck}\}\leq Cn^2+o(n^2).

The conjecture is motivated by experimental data for decks with n=26n=26 and asserts that the worst-case expected absorption time is asymptotically at most quadratic in nn, with leading constant no greater than 22; its status is not established in the supplied source.

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.