Packing in a dilate

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

Problem
Problem 35 in the AlphaEvolve repository: Packing in a dilate
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≥1n \geq 1 and a geometric shape PP (e.g. a polygon, a polytope or a sphere), let C(n,P)C(n, P) denote the smallest scale ss such that one can place nn identical copies of PP with disjoint interiors inside another copy of PP scaled up by a factor of ss. Establish lower and upper bounds for C(n,P)C(n, P) that are as strong as possible.

Statement quoted from problem 35 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.19 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.

∎