All OpenAI manuscripts

OpenAI · 238-06 · 2026-09-26 · Probability and statistical mechanics

Routing densities and representation contraction for Thorp sweeps

preprints/Routing-densities-and-representation-contraction-for-Thorp-sweeps-September-26-2026

Family 238. Optimal logarithmic mixing of the Thorp shuffle.

The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.

Read against the standing problems

Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N

Proves that the Thorp shuffle randomizes labeled cards in physical shuffles, settling its optimal mixing order for power-of-two deck sizes. Convergence is in total variation from the worst initial ordering and concerns the entire permutation, not just individual card positions.

For cards, we prove that an absolute number of coordinate sweeps of the Thorp shuffle brings the full permutation law to total-variation distance tending to zero from uniform. The mixing time therefore has optimal order in physical shuffles.

Preprint source and Lean scope

The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.

This preprint is named in the Lean scope note for 238: Optimal logarithmic mixing of the Thorp shuffle. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.

ThorpFirstReciprocal.lean · ThorpFirstReciprocal.lean

Statement file

ThorpRemaining.lean · ThorpRemaining.lean

Statement file

PartialPermutation.lean · PartialPermutation.lean

Statement file

ThorpRouting.lean · ThorpRouting.lean

Statement file

OccupiedOverlap.lean · OccupiedOverlap.lean

Statement file

WeightedSweepMoments.lean · WeightedSweepMoments.lean

Statement file

CoordinateTrace.lean · CoordinateTrace.lean

Statement file

ThorpWeightedCompatibility.lean · ThorpWeightedCompatibility.lean

Statement file

SpinAngle.lean · SpinAngle.lean

Statement file

SignedSweepMoment.lean · SignedSweepMoment.lean

Statement file

BinarySweep.lean · BinarySweep.lean

Statement file

CoordinateSweeps.lean · CoordinateSweeps.lean

Statement file

FourRowPermanent.lean · FourRowPermanent.lean

Statement file