Conditional permutations in a revealed switching environment
For and any deterministic starting deck, after sweeps with and , the conditional free-slot law satisfies as . Consequently, the full-deck law approaches uniform uniformly in the starting deck after physical shuffles, while for every integer the full-deck distance from uniform after physical shuffles is at least , establishing that the full-deck mixing time is of order .
The proof across Sections 2 through 4.5 is complete, self-contained, and rigorously establishes both the conditional free-slot uniformity and the full-deck mixing time upper and lower bounds.
“Theorem 1.1 (Conditional permutation and full-deck mixing). Let n = 2d , and start the shuffle from any deterministic deck. After J(s0 +1) sweeps, where s0 = 400 and J = 40000, the conditional free-slot law defined above satisfies sup initial layouts E E ∥νE − Un/2∥TV −→ 0 (d −→ ∞). Consequently the full-deck law approaches uniform, uniformly in the starting deck, after 16 040 400d physical shuffles. For every integer t ≥ 0, after t physical shuffles the full-deck distance from uniform is at least 1 − 2 tn/2/n!. Thus the full-deck mixing time is of order d.” · Show in paper