No-Go Theorems for Poisson Certificates of Gaussian Mass Maximality
For , the natural scalar Poisson-summation certificates cannot prove the Regev-Stephens-Davidowitz Gaussian mass conjecture: any such certificate saturates, so the whole approach is blocked.
- Result
- Proved(see note)
- Status
- Partial result
- AI contribution
- AI-assisted
- Method
- Argument
- Field
- Geometry of numbers
- Posed by
- Oded Regev, Noah Stephens-Davidowitz
- Year posed
- 2017
- Years open
- 9y
- Solved
- 2026-05-26
- Model
- GPT-5.5 Pro, Claude Opus 4.7
- Vendor
- OpenAI / Anthropic
- Collaborators
- Scott Duke Kominers
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 25 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
a barrier result about one proof strategy, not the conjecture itself
What the AI did
The disclosure says the models were used for computations, analysis and synthesis in preparing the article, without separating which of the three, so the lowest tier applies.
Verification
Single-author arXiv preprint; not yet peer-reviewed.