Heilbronn triangle problem in a square $H(12)$
The largest possible area of the smallest triangle formed by three of $12$ points in a unit square.
Lower bound:
${\approx}0.03259885869$
Checked construction
Upper bound:
$\frac{1}{11}$
(≈0.09090909)
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 |
|---|---|---|---|
| 1972-05 | $\ge \frac{1}{33}$ (≈0.03030303) | M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. |
Checked construction
via $\ge 0.03259885869$, heilbronn-square-12-lower-0p03259885869 |
| 1972-05 | $\le \frac{1}{11}$ (≈0.09090909) | M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. | Literature |
| 2001-10-01 | $\ge {\approx}0.03259885869$ |
F. Comellas and J.L.A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002) #R6.
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.] |
Checked construction
via $\ge 0.03259885869$, heilbronn-square-12-lower-0p03259885869 |