A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Exponential semidefinite complexity of perfect matching
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:1
Category:Theoretical computer science Lean version:YES! ✔
Rate this game! 4.0 out of 5 (8,642 votes)

>>> How to Play <<<
Exponential semidefinite complexity of perfect matching. Proves that every exact semidefinite lift of the perfect matching polytope has exponential size, answering Rothvoss's polynomial-size lift question negatively. The bound holds even for the positive semidefinite rank of its odd-cut slack matrix after any fixed shift $0\lt \rho\lt 1$, allowing arbitrary real positive semidefinite factors.

>>> Level Select <<<
released 2026-10-05  |  3 theorems · 6 lemmas · 12 proofs · 9,888 words  |  PLAY LEVEL 1 »  (pdf)
For every fixed $0\lt \rho\lt 1$, the matrix indexed by odd vertex sets U and perfect matchings M of Kn, with entries $|M\cap\delta(U)|-1+\rho$, has real positive semidefinite rank $2^{\Omega(n)}$ as even n tends to infinity. Here $\delta(U)$ is the edge cut of U. Consequently, every exact semidefinite lift of the perfect matching polytope has exponential size.

More Theoretical computer science Games!
A factor-two approximation for shortest common superstringExponential state costs for two-way automataFourier transforms below $n\log n$ HOT!Polynomial mixing of graph switches with prescribed degrees
A counterexample to the quadratic sensitivity conjectureThe complexity of Weisfeiler–Leman refinementGeneralized star height at most threeSharp homogeneous depth-five complexity of matrix products

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games