Heilbronn triangle problem
For a compact set , an integer , and points , let
where denotes the area of the triangle with vertices , taken to be when the three points are collinear. Define
the maximum being attained because is compact and is continuous.
If and are compact convex sets of nonzero area, then there are constants depending on and but not on such that
since some affine image of is contained in and an affine map multiplies all triangle areas by a fixed factor. Consequently the growth rate of , up to constant factors, does not depend on the choice of compact convex of nonzero area; write for this common growth rate, and write when is the unit square .
Determine the asymptotic behaviour of as : exhibit an explicit function with . In particular, determine whether the limit
exists, and determine its value, i.e. determine the least exponent such that .
References
- Wikipedia, Heilbronn triangle problem, the article this problem comes from.
Source: Wikipedia
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
Claimed by OpenAI. For absolute constants eta>0 and c>0 and every sufficiently large n, the manuscript claims n points in the unit square for which every triangle has area at least c*n^(-2+eta). This gives a lower bound for the page’s extremal triangle area and rules out an exponent of two if its requested limit exists. It does not determine the exact asymptotic order or establish that the exponent limit exists.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-191-01-A-power-improvement-in-the-Heilbronn-triangle-lower-bound.pdfOpen