New state-of-the-art results on open problems in combinatorics and harmonic analysis, obtained by AI agents.
| Problem | Objective | Our Result | Previous Best | Improvement |
|---|---|---|---|---|
| Erdős' Minimum Overlap | minimize | 0.380871 | 0.380876 | −0.000005 |
| First Autocorrelation Inequality | minimize | 1.50286286 | 1.50286290 | −0.00000004 |
| Second Autocorrelation Inequality | maximize | 0.961206 | 0.962580† | — |
| Third Autocorrelation Inequality | minimize | 1.454555 | 1.455643 | −0.001088 |
| Min Distance Ratio (2D, n=16) | minimize | 12.889230 | 12.889266 | −0.000036 |
†ImprovEvolve (arXiv:2602.10233) reports 0.96258, but the solution is not publicly available. The previous publicly available best is 0.961021 from AlphaEvolve's repo.
Each folder contains:
- README.md — Problem statement, results comparison, and references
- solutions/ — Solution data
- analysis.ipynb — Verification and visualization
