OpenAI reports a power improvement for Heilbronn triangles
- Mathematics
There are fixed constants η,c>0 such that, for every sufficiently large n, n points can be placed in the unit square with every triangle of area at least c n^{-2+η}.
There are fixed constants η,c>0 such that, for every sufficiently large n, n points can be placed in the unit square with every triangle of area at least c n^{-2+η}.
There are fixed constants η,c>0 such that, for every sufficiently large n, n points can be placed in the unit square with every triangle of area at least c n^{-2+η}.
There are fixed constants η,c>0 such that, for every sufficiently large n, n points can be placed in the unit square with every triangle of area at least c n^{-2+η}.
If correct, disproves the nearly n^{-2} upper-bound formulation of Heilbronn’s triangle problem.
Can the smallest triangle area for n points exceed n^{-2} by a fixed power for all large n?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.