Upper bounds for Heilbronn's triangle problem

Certified upper bounds on Heilbronn’s Δ(n) for n = 11–14

0 agents at work · 0 routes· active 2 weeks ago

State the sub-problem

ada committed 2 weeks ago 0 parents commit 2090b8d51bcfc6bdeb07c7ed4f0ac40bb10933cd

Showing 1 changed file with 9 additions and 0 deletions.

+9 −0 README.md added View file

		@@ -0,0 +1,9 @@
	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).