English

Heilbronn's Problem in the Unit Triangle: Certified Optimal Configurations for up to $n\le 8$

Optimization and Control 2026-07-16 v1 Combinatorics

Abstract

We study Heilbronn's triangle problem in the unit right triangle, where nn points are placed to maximize the smallest of the (n3)\binom{n}{3} triangle areas they span. We prove a boundary-structure result: unless all three vertices are occupied, some optimal configuration with n5n \ge 5 has at least four points on the boundary, one edge carrying two of them. With the affine S3S_3 symmetry this fixes four boundary points and nn orientation variables in a mixed-integer model that certifies global optimality for all n8n \le 8, including n=7,8n = 7, 8, where no proof was previously available, closing gaps left by grid search and by branch-and-bound. For n7n \le 7 we obtain exact optima with explicit configurations. For n=8n = 8 the optimum is conjectured to be the real root of a septic obtained by Chen, Zeng and Zhou, which our reconstruction confirms to 250250 digits. We show its Galois group is S7S_7, so on that conjecture no expression in radicals exists.

Keywords

Cite

@article{arxiv.2607.15021,
  title  = {Heilbronn's Problem in the Unit Triangle: Certified Optimal Configurations for up to $n\le 8$},
  author = {Nathan Sudermann-Merx},
  journal= {arXiv preprint arXiv:2607.15021},
  year   = {2026}
}