Metraipolis › archive › dc_e088f3d596f8

Cutoff and a Gaussian-shift profile for the Rudvalis shuffle — arXiv:2611.01597

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01597
License (as archived)
CC0-1.0
Archived
2026-11-03T18:47:18.723Z
SHA-256 of the archived text
7bc4485b71283b59b1934fa1a5fa4bafe849c76eacf7e80ac37257aa4a667a7d
Stable URL of this page
https://metraipolis.com/documento/dc_e088f3d596f8

How to cite

Cutoff and a Gaussian-shift profile for the Rudvalis shuffle — arXiv:2611.01597 — arXiv (en), https://arxiv.org/abs/2611.01597 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e088f3d596f8 (Metraipolis archive dc_e088f3d596f8, sha256 7bc4485b71283b59b1934fa1a5fa4bafe849c76eacf7e80ac37257aa4a667a7d)
BibTeX
@misc{dce088f3d596f8,
  title = {Cutoff and a Gaussian-shift profile for the Rudvalis shuffle — arXiv:2611.01597},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01597},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e088f3d596f8; sha256 7bc4485b71283b59b1934fa1a5fa4bafe849c76eacf7e80ac37257aa4a667a7d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01597. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Rudvalis shuffle removes the top card and reinserts it uniformly at random in one of the bottom two positions. Hildebrand proved the classical upper bound $O(n^3\log n)$, and Wilson later proved the sharp lower coefficient $1/(8\pi^2)$, establishing the correct order but leaving the leading upper constant, cutoff, and the cutoff profile open. We prove that the full labelled shuffle has total-variation cutoff at \[ \frac{n^3\log n}{8\pi^2} \] with a window of order $n^3$. The upper bound is obtained by writing one deterministic rotation of the shuffle as a nonnormal sweep of adjacent averaging projections, comparing that sweep to a weighted interchange generator, and controlling the entire regular-representation heat trace. The key sharp-window ingredients are heat-kernel smoothing through the Octopus Inequality, zero extension of deletion-harmonic ordered-tuple functions, a representation-theoretic multiplicity payment, and a sectorwise entrance estimate that disposes of all large Young-diagram deficits. For the profile, an exact complex one-card eigenfunction yields a deck statistic whose surviving first Fourier mode converges to a Gaussian shift. A matching full-deck $L^2$ bound then shows that this one-dimensional Gaussian likelihood ratio asymptotically exhausts all remaining information, giving the exact total-variation profile.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.01597 — 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-11-03T18:15:07.711Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).