Exactly certified work on Heilbronn's triangle problem: one improved lower bound in the unit disk (n=14), plus a rigidity audit of the unit-square landscape. Every number re-derived from integers in exact arithmetic.
python reproducible-research mathematics open-data computational-geometry lower-bounds combinatorial-optimization discrete-geometry exact-arithmetic rigidity-theory certified-computation heilbronn-triangle-problem extremal-geometry prestress-stability unit-disk
-
Updated
Sep 3, 2026 - Python