Triangle, n = 8 numerically optimal
A =
the unique real root of
= 0.0677892132541972123588108049740286304958007014…
polynomial for the unit right triangle, A twice its root; Galois group S₇ (Sudermann-Merx), so no radical form exists
Symmetry
Not symmetric (group C1, order 1).
Minimal triangles
11 triangles tied (within relative 10−9) at the minimal area, in 11 congruence classes:
| count | side lengths | triangles (point indices) |
|---|---|---|
| 1 | 0.2111 · 0.6481 · 0.6542 |
(1,4,5) |
| 1 | 0.4347 · 0.5339 · 0.9223 |
(2,4,6) |
| 1 | 0.2111 · 0.7827 · 0.9198 |
(1,5,6) |
| 1 | 0.4356 · 0.6328 · 1.0346 |
(0,3,6) |
| 1 | 0.5339 · 0.5355 · 1.0369 |
(4,6,7) |
| 1 | 0.4510 · 0.6542 · 1.0749 |
(1,3,4) |
| 1 | 0.3703 · 0.9248 · 1.2733 |
(0,1,2) |
| 1 | 0.6481 · 0.6861 · 1.3182 |
(0,4,5) |
| 1 | 0.6328 · 0.7325 · 1.3504 |
(0,3,7) |
| 1 | 0.6403 · 0.7325 · 1.3581 |
(2,3,7) |
| 1 | 0.5355 · 0.9198 · 1.4421 |
(1,6,7) |
Provenance
- Found by David Cantrell, July 2006.
- Numerically optimal: solved to global optimality within solver tolerances by Nathan Sudermann-Merx, July 2026. The certificate is floating-point, not a rigorous proof.
- Coordinates generated from the exact construction:
data/sources/exact/constructions.py— exact realization of the certified optimum: each coordinate an explicit degree-7 algebraic number, identified here from the tie system (minimal polynomials in data/sources/exact/triangle-n08-coordinate-minpolys.json). - Verified in exact arithmetic: all 56 triples enumerated, 11 tied at the minimum.
Record history
- 2026-08-22 exact realization of the certified optimum: tie system solved to 400 digits, every coordinate identified as an explicit degree-7 algebraic number (this site); replaces the reconstruction
- 2026-11 status changed from proven to numerically optimal: the certificate (arXiv:2607.15021) is a Gurobi run with a 10⁻⁴ relative MIP gap in floating point, and the exact optimum (the septic root) remains a conjecture of Chen, Zeng and Zhou
- 2026-11-14 computer-assisted proof of optimality posted by Ethan Hendren: an exact-arithmetic branch and bound over the whole configuration space (LP bounds verified in exact integer arithmetic, neighbourhood of the optimum closed by an interval-arithmetic certificate) shows that the value is twice the unique real root of the septic, with the known configuration unique up to symmetry; AI-assisted and not yet independently verified, so the entry stays numerically optimal
Downloads
- points.txt coordinates, tab-separated
- points.csv coordinates, CSV
- points.json full record: value, provenance, verification
- figure.svg this figure
References
- N. Sudermann-Merx, Heilbronn's Problem in the Unit Triangle: Computational Optimality Certificates for n ≤ 8, arXiv:2607.15021, to appear in Operations Research Proceedings 2026
- E. Hendren, A computer-assisted proof of optimality for Heilbronn's problem with eight points in a triangle (November 2026), github.com/NERD-NEH007/heilbronn-discovery-lab
- L. Chen, Z. Zeng, W. Zhou, An upper bound of Heilbronn number for eight points in triangles, J. Comb. Optim. 28(4) (2014) 854–874