Heilbronn triangle problem in a triangle $\Delta(8)$
The largest possible area of the smallest triangle formed by three of $8$ points in a triangle of unit area.
Lower bound:
${\approx}0.06778921325$
Checked construction
Upper bound:
$\frac{35555}{524288}$
(≈0.06781578)
Literature
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.06778921325$ |
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.06778921325$, heilbronn-triangle-8-lower-0p06778921325 |
| 2013-01-08 | $\le \frac{35555}{524288}$ (≈0.06781578) | L. Chen, Z. Zeng and W. Zhou, An upper bound of Heilbronn number for eight points in triangles, Journal of Combinatorial Optimization 28 (2014) 854-874. | Literature |