Heilbronn triangle problem in a square $H(14)$
The largest possible area of the smallest triangle formed by three of $14$ points in a unit square.
Lower bound:
${\approx}0.02430397962$
Checked construction
Upper bound:
$\frac{1}{13}$
(≈0.07692308)
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 {\approx}0.020$ | 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.02430397962$, heilbronn-square-14-lower-0p02430397962 |
| 1972-05 | $\le \frac{1}{13}$ (≈0.07692308) | M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144. | Literature |
| 2006-08 | $\ge {\approx}0.02430397962$ |
M. Beyleveld, Heilbronn configurations for 14 and 16 points in the square (August 2006), in E. Friedman, The Heilbronn problem for squares, Erich's Packing Center.
[via E. Friedman, The Heilbronn problem for squares, Erich's Packing Center, as archived by the Wayback Machine on 2025-02-19.] |
Checked construction
via $\ge 0.02430397962$, heilbronn-square-14-lower-0p02430397962 |