Preprint in the OpenAI Math release
A power improvement in the Heilbronn triangle lower bound
OpenAI
Abstract
There are absolute constants 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 . Thus the almost n upper-bound formulation of Heilbronn's triangle problem is false. The exponent η is fixed but extremely small.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.