An autocorrelation problem related to Sidon sets

AlphaEvolve found a construction that improved on the best bound known at the time; the problem itself remains open.

Problem
Problem 2 in the AlphaEvolve repository: An autocorrelation problem related to Sidon sets
Credit
AlphaEvolve (Google DeepMind) · LLM-guided evolutionary code search, with Georgiev, Gómez-Serrano, Tao and Wagner
Checked
Construction can be checked directlyPreprint (arXiv, 2025)
Timeline
Paper submitted 2025-11-03
Sources
Problem page (AlphaEvolve repository)Paper (arXiv:2511.02864)
PARTIALImproved bound · new construction

The problem

Let CC denote the largest constant for which one has

max⁡−1/2≤t≤1/2∫Rf(t−x)f(x)dx≥C(∫−1/41/4f(x)dx)2\max_{-1/2 \leq t \leq 1/2} \int_\mathbb{R} f(t-x) f(x) dx \geq C \left(\int_{-1/4}^{1/4} f(x) dx\right)^2

for all non-negative f ⁣:R→Rf \colon \mathbb{R} \to \mathbb{R}. What is CC?

Statement quoted from problem 2 of the AlphaEvolve repository of problems (Google DeepMind, CC BY 4.0).

What AI did

AlphaEvolve found a construction that improved on the best bound known at the time; the problem itself remains open. Status in the repository: New result. See Section 6.2 in "Mathematical Exploration and Discovery at Scale" paper. Records may have moved since; the repository's notes below list the latest bounds it knows of.

Notes from the repository

Upper bounds for CC

Bound Source Date
π/2=1.57059\pi/2 = 1.57059 Schinzel-Schmidt 2002
1.509921.50992 Matolcsi-Vinuesa 8 Jul 2009
1.50531.5053 Georgiev-Gómez-Serrano-Tao-Wagner [Colab 1] [Colab 2] 14 May 2025
1.50321.5032 Georgiev-Gómez-Serrano-Tao-Wagner [Colab 1] [Colab 2] 20 Dec 2025
1.50291.5029 Yuksekgonul et al. Jan 2026

Lower bounds for CC

Bound Source Date
11 Trivial
1.1827781.182778 Martin-O'Bryant 30 Sep 2004
1.2621.262 Martin-O'Bryant 1 Apr 2009
1.27481.2748 Matolcsi-Vinuesa 8 Jul 2009

See also Damek Davis's meta-analysis of this problem.

How it was checked

The results are explicit constructions or programs; the repository's notebooks include the verification code used to score them.

Limitations

An improved bound is progress, not a solution: the exact answer to the problem is still unknown. The authors report that results were better when experts set up and guided the search.

∎