An Improved Lower Bound for the Card-Cyclic-to-Random Shuffle
Year: 2026
Type: article
Abstract: In the card-cyclic-to-random shuffle of n cards, the cards labelled 1, ..., n are removed in turn, cyclically, and each is reinserted at a uniformly random position. Morris, Ning and Peres proved that the mixing time is of order n log n, with a lower bound of c n log n for every c < 1/(2+2a), where -a+ib is a root of e^{-z} = 1-z and a is about 2.089. We raise the lower constant from about 0.162 to 1/(2a), about 0.239. On functions of the relative order of pairs of cards the chain acts as the exterior square of an explicit n by n matrix. Two eigenvectors of that matrix give an exact eigenfunction of the chain, with eigenvalue of modulus 1 - a/n + O(n^{-2}), and a second-moment argument finishes the proof. Whether the shuffle has cutoff remains open.
Author: Yitzchak Shmalo
Institution: Hebrew University of Jerusalem
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233825873
