Combinatorics · Oct 6, 2026
A power improvement in the Heilbronn triangle lower bound
For every sufficiently large n, constructs n points in the unit square such that every triangle has area at least for one absolute c > 0. This disproves the conjectured almost-n−2 upper bound in Heilbronn's triangle problem, which asks how large the smallest determined triangle can be.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model