An upper bound for the single-card spectral gap of the overlapping-cycles shuffle

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24287618
Primary Topic
Probability and Statistical Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An upper bound for the single-card spectral gap of the overlapping-cycles shuffle

Yitzchak Shmalo
1 links
Zenodo (CERN European Organization for Nuclear Research)
Probability and Statistical Research
preprint

An upper bound for the single-card spectral gap of the overlapping-cycles shuffle

Yitzchak Shmalo
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Probability and Statistical Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon