Prove SwitchChain (openai/math family 131: Polynomial mixing of graph switches with prescribed degrees) in…
Prove SwitchChain (openai/math family 131: Polynomial mixing of graph switches with prescribed degrees) in…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 131 of the release, Polynomial mixing of graph switches with prescribed degrees…
The task
Context: this statement belongs to family 131 of the release, *Polynomial mixing of graph switches with prescribed degrees* (Theoretical computer science). The family as a whole: Resolves the simple-undirected Kannan–Tetali–Vempala conjecture: the lazy edge-switch chain mixes in $O(n^8)$ time for every graphical…
Part of raising-heart/openai-math.