A computer-assisted proof of optimality for Heilbronn's problem with eight points in a triangle

For Heilbronn's problem in a triangle, we give a computer-assisted proof that the largest possible minimum triangle area of eight points, divided by the area of the triangle, is 2θ = 0.0677892132…, where θ is the unique real root of the septic 1216512t⁷ + 1022976t⁶ − 2745456t⁵ + 2218730t⁴ + 32206304t³ − 19148615t² + 3156103t − 86233. This confirms the value conjectured by Chen, Zeng and Zhou. The value is attained only by the known configuration and its images under the six affine symmetries of the triangle. Optimality for n = 8 had previously been established by global optimization within solver tolerances, not rigorously. The proof ports the branch and bound of the nine-point square paper to the triangle. Every discarded box is discarded by a test evaluated in exact arithmetic. The run took 2.44·10^8 nodes and 9.6 hours on 14 worker processes, with no failures. The optimal value is identified exactly with the root of the septic. This is an AI-assisted, computer-assisted proof that has not been independently checked.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24235151
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A computer-assisted proof of optimality for Heilbronn's problem with eight points in a triangle

Ethan Hendren
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

A computer-assisted proof of optimality for Heilbronn's problem with eight points in a triangle

Ethan Hendren
preprint en

Abstract

For Heilbronn's problem in a triangle, we give a computer-assisted proof that the largest possible minimum triangle area of eight points, divided by the area of the triangle, is 2θ = 0.0677892132…, where θ is the unique real root of the septic 1216512t⁷ + 1022976t⁶ − 2745456t⁵ + 2218730t⁴ + 32206304t³ − 19148615t² + 3156103t − 86233. This confirms the value conjectured by Chen, Zeng and Zhou. The value is attained only by the known configuration and its images under the six affine symmetries of the triangle. Optimality for n = 8 had previously been established by global optimization within solver tolerances, not rigorously. The proof ports the branch and bound of the nine-point square paper to the triangle. Every discarded box is discarded by a test evaluated in exact arithmetic. The run took 2.44·10^8 nodes and 9.6 hours on 14 worker processes, with no failures. The optimal value is identified exactly with the root of the septic. This is an AI-assisted, computer-assisted proof that has not been independently checked.

Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon