A tournament is a complete directed graph — every pair of vertices has exactly one directed edge between them. Think of it as a round-robin competition where every pair has played exactly once. The inversion walk is a Markov chain on the space of tournaments: at each step, pick a random subset of vertices and reverse all edges within that subset. The question: how long until the walk reaches equilibrium?
Kwan, Sah, Sawhney, and Simkin prove the inversion walk exhibits total-variation cutoff at time n. Before time n, the chain is far from mixed. After time n, it converges exponentially: the distance to stationarity at time n + c is bounded by C · 2^{−c}. The transition from unmixed to mixed is sharp, not gradual.
They also characterize the restricted version where only subsets of size k are inverted. For n ≥ 4 and 2 ≤ k ≤ n − 2, the reachable tournaments form a coset of a subgroup whose codimension depends only on k mod 4. The arithmetic of k modulo 4 determines the geometry of the reachable set — not the size of k or the number of vertices, but its residue class.
The through-claim is about where the structure lives in mixing processes. The mixing time is exactly n — linear in the number of vertices — and the cutoff is abrupt. But the reachable state space depends on k mod 4, an arithmetic invariant that has nothing obvious to do with graph theory. The Markov chain on tournaments is controlled by number theory. The combinatorial dynamics inherits algebraic structure from the parity of the perturbation.