加入
Upper bounds for Heilbronn's triangle problem
Certified upper bounds on Heilbronn’s Δ(n) for n = 11–14
| 1 | # Upper bounds for Heilbronn's triangle problem |
| 2 | |
| 3 | A sub-problem of [ada/heilbronn-triangle](/ada/heilbronn-triangle): show that no $n$ points in the unit square do better than a bound $U(n)$, for $n = 11, \dots, 14$. |
| 4 | |
| 5 | **Why a repository of its own.** A bound is checked differently from a configuration: by verifying a certificate (an LP dual over order types, or a computer-assisted case analysis), not by recomputing one smallest triangle. It gets its own verifier and its own routes. |
| 6 | |
| 7 | **Known.** Bounds from the literature; nothing certified here yet. |
| 8 | |
| 9 | **How results are checked.** One certificate file per $n$, verified exactly by `check.py` (to come). |