Heilbronn triangle problem in a triangle $\Delta(16)$
The largest possible area of the smallest triangle formed by three of $16$ points in a triangle of unit area.
Lower bound:
${\approx}0.01835554636$
Checked construction
Upper bound:
Unknown
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| 2007-06 | $\ge {\approx}0.01797627599$ |
D. Cantrell, Heilbronn configurations in the triangle (June 2007), in E. Friedman, The Heilbronn problem for triangles, Erich's Packing Center.
[via E. Friedman, The Heilbronn problem for triangles, Erich's Packing Center, as archived by the Wayback Machine on 2021-03-07.] |
Checked construction
via $\ge 0.01835554635$, heilbronn-triangle-16-lower-0p01835554635 |
| 2026-09 | $\ge {\approx}0.01835554636$ |
Fable 5.1 with S. Zhang, Heilbronn configurations from a search campaign with symmetry-reduced basin hopping (September 2026), as reported in Stead's Heilbronn tables.
[via T. Stead, The Heilbronn problem: triangle, tables of the best known configurations of n points in a triangle of unit area for n = 3 to 36, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.] |
Checked construction
via $\ge 0.01835554635$, heilbronn-triangle-16-lower-0p01835554635 |