A power improvement in the Heilbronn triangle lower bound
Recorded by the registry's curators from GitHub; the authors did not submit it here.
OpenAI
There are absolute constants $\eta,c_1>0$ such that, for every sufficiently large integer $n$, one can choose $n$ points in the unit square so that every triangle they determine has area at least $c_1n^{-2+\eta}$. Thus the almost $n^{-2}$ upper-bound formulation of Heilbronn's triangle problem is false. The exponent $\eta$ is fixed but extremely small.
Claims
SOLUTION CLAIMED
OP-01140 — Heilbronn's triangle problem
Files and sources
- Paper
- math @ 4eaee87, build/main.tex ↗
- Posted on GitHub
- 6 October 2026
No verification run is on record for this version.