On the position matrix of single-shelf shuffle and card guessing

TL;DR

This paper analyzes the spectral properties of the position matrix in single-shelf card shuffles, resolving conjectures and deriving bounds on the expected number of correct guesses in card guessing games.

Contribution

It determines the full spectrum and eigenspaces of the position matrix for single-shelf shuffles, confirming two recent conjectures and analyzing guessing game performance.

Findings

Full spectrum and eigenspaces of the position matrix are characterized.

Maximum expected correct guesses after multiple shuffles is bounded by $1+O(n^{-2\\epsilon})$.

Expected correct guesses after one shuffle are at most \\sqrt{2n/\\pi}+1+O(n^{-1/2}).

Abstract

Mechanical shufflers used in many casinos employ a card shuffling scheme called \emph{shelf shuffling}. In a single-shelf shuffling, cards arrive sequentially, and each incoming card is independently placed on the top or the bottom of a shelf with equal probability. The position matrix of a single-shelf shuffling encodes the probability that the $i$-th incoming card is in position $j$ after one round of single-shelf shuffle. The spectral properties of the position matrix of card shuffling schemes are helpful in the analysis of card guessing games without feedback. In this paper, we determine the full spectrum and the corresponding eigenspaces of the position matrix $M$ of a single-shelf shuffle. This strengthens and resolves two conjectures in a recent work [arXiv:2507.10294]. As a consequence of these results, we show that the maximum number of expected correct guesses without feedback after $k\geq (1+\epsilon)$ many shuffles is of the order $1+O(n^{-2\epsilon})$. On the other hand, the expected number of correct guesses after one shuffle is at most $\sqrt{2n/\pi}+1+O(n^{-1/2})$, and we give a strategy (not optimal) that achieves $\sqrt{2n/\pi}-1$ number of correct cards in expectation.