Heilbronn problem in a fixed bounding box

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

Problem
Problem 48 in the AlphaEvolve repository: Heilbronn problem in a fixed bounding box
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

For any n≥3n \geq 3 and any convex body KK in the plane, let C(n,K)C(n,K) be the largest quantity such that in every configuration of nn points in KK, there exists a triple of points determining a triangle of area at most C(n,K)C(n,K) times the area of KK. Establish upper and lower bounds on C(n,K)C(n,K).

Statement quoted from problem 48 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.29 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.

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.

∎