An upper bound for the single-card spectral gap of the overlapping-cycles shuffle
Year: 2026
Type: preprint
Abstract: In the overlapping-cycles shuffle of a deck of n cards, the card at position n or the card at position n − k is moved to the top, each with probability one half. Angel, Peres and Wilson determined the spectral gap gap(n,k) of the chain followed by a single card, up to a factor 1 + o(1) uniform in k, as the minimum of an explicit family of quadratic expressions. They asked whether gap(n,k) ≤ (2π²/√3 + o(1)) k^(1/2) n^(−2) for all 1 ≤ k < n. We show that it does. Their minimum is a constant multiple of the squared length of the shortest vector of a plane lattice of determinant 2, and Hermite's bound for plane lattices gives the inequality with this constant; Dirichlet's approximation theorem, used by Angel, Peres and Wilson, gives 2π². At n = 26, k = 12 the lattice is hexagonal and the bound on the minimum is attained exactly.
Author: Shmalo, Yitzchak
Institution: Hebrew University of Jerusalem
Language: English
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234318705
