Metraipolis › archive › dc_fd87a7f79ec9
Cutoff for the Overhand Shuffle — arXiv:2610.00137
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.00137
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:35:13.599Z
- SHA-256 of the archived text
43b72f330b79d362637e57997f0f6528bac7329721b28425ec4337f36397522c- Stable URL of this page
https://metraipolis.com/documento/dc_fd87a7f79ec9
How to cite
Cutoff for the Overhand Shuffle — arXiv:2610.00137 — arXiv (en), https://arxiv.org/abs/2610.00137 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd87a7f79ec9 (Metraipolis archive dc_fd87a7f79ec9, sha256 43b72f330b79d362637e57997f0f6528bac7329721b28425ec4337f36397522c)
BibTeX
@misc{dcfd87a7f79ec9,
title = {Cutoff for the Overhand Shuffle — arXiv:2610.00137},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.00137},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd87a7f79ec9; sha256 43b72f330b79d362637e57997f0f6528bac7329721b28425ec4337f36397522c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00137. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the overhand shuffle with a fixed cut probability $p\in(0,1)$. In the packet-reversal convention, each gap is cut independently with probability $p$, and each resulting packet is reversed in place. We prove total-variation cutoff at \[ \frac{p^2}{2(1-p)\pi^2}\,n^2\log n. \] The lower bound uses an exact finite-deck cosine eigenfunction and a uniform conditional-variance estimate. For the upper bound, a coalescing coupling reduces a transposition discrepancy to a symmetric killed two-card chain. Its principal decay rate is $(1-p)\pi^2/(p^2n^2)+o(n^{-2})$. A boundary-flux identity bounds the sum of adjacent discrepancy probabilities without a factor equal to the deck size. The remaining ingredient is a two-sided $L^1$ inequality on permutations, with constant at most $\sqrt n\exp\{O(\sqrt{\log n\log\log(n+2)})\}$. Its proof decomposes a fixed block-table fiber into assignment words and independent smaller permutations, and closes a recursion using a multivariate hypergeometric inequality and an explicit routing comparison. We also prove relative-entropy cutoff with an $O_p(n^2)$ window about the intrinsic entropy transition time. Its leading coefficient lies between the total-variation coefficient and twice that value; a sharp entropy location is not obtained. The proof states the normalization and hypotheses of its established functional-inequality inputs. An appendix proves the intermediate static bounds and explains the change from one-scale averaging to recursive fibers.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.00137 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:02:27.435Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).