Mixing Time of Kac's Walk on the Rotation Group

Precise statement

Kac's walk on the rotation group, introduced by Hastings in 1970, is a central high-dimensional Markov chain in statistical physics and computational science. The paper proves it mixes in $n^2 \log n$ steps, the conjectured optimal rate, closing the gap left by a long line of successive improvements.

The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.

What AI did

GPT Pro 5.4

"Much of this paper was developed in collaboration with GPT Pro 5.4. In particular, the idea of using matrix martingale inequalities" came from that collaboration. Pillai and Smith are the authors of the previous best bounds for this walk.

Provider: OpenAI · Prompt public: unknown · Independence: unknown

Verification boundary

unreviewed

No verification note supplied.

Correctness: unknown · statement fidelity: unaudited · peer review: none

Timeline

1. 2026-04-26

   arXiv

   VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Known method families

argument (source-reported)

Source-reported tools: argument.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

• VibeMath has not independently verified the mathematical claim.
• AI-attempt independence and training-data exposure are unknown unless explicitly documented.
• VibeMath has not independently audited the mathematical statement, proof, or novelty claim.