Quadratic upper-bound conjecture for random card shuffling
Statement
Let be a deck with cards of each type, and let denote the expected number of steps to absorption for the random card-shuffling process started from . As , quadratic upper-bound conjecture. There is an absolute constant such that
The conjecture is motivated by experimental data for decks with and asserts that the worst-case expected absorption time is asymptotically at most quadratic in , with leading constant no greater than ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.