Delphi.science

Heilbronn's triangle problem in the unit square: nine points

Source: github.com/vltanh/lean4-heilbronn/tree/a405d9b79c16eb34dc1c…

The-Anh Vu-Le

Palomar Registrypalomar/PALOMAR-2026-11-20-000006Nov 20, 2026math.MGscore 0

The Heilbronn number H_n of the unit square is the largest possible least area of a triangle with vertices at three of n points in the closed unit square. This entry proves H₉ = (9√65 − 55)/320 ≈ 0.0548760, and that it is attained only by the configuration of Comellas and Yebra (2002), with two points on each side of the square and one inside, up to the eight symmetries of the square and relabelling. The proof normalizes a maximizing configuration by affine maps into five families, by the corners of the square it occupies, and excludes or classifies each family by geometric case analysis,…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-20-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000006/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'