VibeMathedMath problems solved by AI
All problems

Monochromatic Quantum Graphs in the Diagonal Family

Can a complete edge-coloured, complex-weighted graph realize perfect-matching amplitudes of one on every monochromatic inherited vertex colouring and zero otherwise? Nonexistence is proved in the diagonal family N=DN = D for every even N4N \ge 4, alongside further finite cases.

Result
Disproved(see note)
Status
Partial result
AI contribution
AI-discovered
Method
Construction
Field
Quantum optics & graph amplitudes
Posed by
Year posed
2017
Years open
9y
Solved
2026-05-21
Model
AlphaProof Nexus
Vendor
Google DeepMind
Collaborators
Verification
Lean-verified
Publication
Preprint
Significance
10 / 100
Disclosed cost
Wikipedia
No dedicated article

What was actually shown

the diagonal family is ruled out; the broader two-parameter problem remains open

What the AI did

Solved autonomously by AlphaProof Nexus, with the proofs formally verified in Lean.

Verification

Lean-checked; formal proofs published with DeepMind's AlphaProof Nexus report (arXiv:2605.22763).

Source

arXiv:2605.22763 - AlphaProof Nexus report

Discussion