Heilbronn triangle problem in a square $H(9)$
The largest possible area of the smallest triangle formed by three of $9$ points in a unit square.
Lower bound:
$\frac{9\sqrt{65}-55}{320}$
(≈0.054876)
Checked construction
Upper bound:
$\frac{1}{8}$
(≈0.125)
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 |
|---|---|---|---|
| 1970-05 | $\le \frac{1}{8}$ (≈0.125) | S.H.L. Kung, Problem 745 (A nine point problem), Mathematics Magazine 42 (1969), solution by B.L. Schwartz, Mathematics Magazine 43(3) (1970) 170-171. | Literature |
| 1972-05 | $\ge \frac{1}{21}$ (≈0.04761905) | 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.05487599917$, heilbronn-square-9-lower-0p05487599917 |
| 2001-10-01 | $\ge \frac{9\sqrt{65}-55}{320}$ (≈0.054876) | F. Comellas and J.L.A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002) #R6. |
Checked construction
via $\ge 0.05487599917$, heilbronn-square-9-lower-0p05487599917 |