Heilbronn triangle problem in a triangle $\Delta(11)$
The largest possible area of the smallest triangle formed by three of $11$ points in a triangle of unit area.
Lower bound:
${\approx}0.03652988988$
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 |
| 2006-07 |
$\ge {\approx}0.0360$
|
D. Cantrell, Heilbronn configurations in the triangle (July 2006), 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.03652988988$, heilbronn-triangle-11-lower-0p03652988988
|
| 2025-06-16 |
$\ge {\approx}0.03652988988$
|
A. Novikov, N. Vũ, M. Eisenberger, E. Dupont, P.-S. Huang, A.Z. Wagner, S. Shirobokov, B. Kozlovskii, F.J.R. Ruiz, A. Mehrabian, M.P. Kumar, A. See, S. Chaudhuri, G. Holland, A. Davies, S. Nowozin, P. Kohli and M. Balog, AlphaEvolve: A coding agent for scientific and algorithmic discovery, arXiv:2506.13131.
[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.03652988988$, heilbronn-triangle-11-lower-0p03652988988
|