Heilbronn triangle problem in a square $H(16)$

The best known placement of 16 points in a square, with the smallest triangles they form shaded

The largest possible area of the smallest triangle formed by three of $16$ points in a unit square.

Lower bound: $\frac{7}{341}$ (≈0.02052786) Checked construction
Upper bound: $\frac{1}{15}$ (≈0.06666667) 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.