Conditional permutations in a revealed switching environment
Fix half the labels in a Thorp shuffle on $2^d$ positions and reveal their complete trajectories. We prove that, after an explicit absolute number of coordinate sweeps, the conditional permutation of the remaining labels approaches uniform in expected total variation as $d\to\infty$, uniformly in the initial layout. The resulting constructions give full-deck mixing in a constant multiple of d physical shuffles.
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/Conditional-permutations-in-a-revealed-switching-environment
curl -X POST /api/v1/records/openai-math/Conditional-permutations-in-a-revealed-switching-environment/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Conditional-permutations-in-a-revealed-switching-environment/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'