Sponsored · Amazon offerTry Amazon Prime freeFast free shipping, Prime Video and more.Start free trial
SponsoredShop Amazon for Heilbronn triangle problemBrowse products on Amazon.Search Amazon
SponsoredAmazon Best Sellers in Kitchen & DiningUpdated hourly by Amazon.Shop best sellers
Sponsored · Popular on AmazonVideo GamesHealth & HouseholdBooksArts, Crafts & Sewing
As an Amazon Associate I earn from qualifying purchases.

Topic summary

Heilbronn triangle problem

Heilbronn triangle problem
Unsolved problem in mathematics
What is the asymptotic growth rate of the area of the smallest triangle determined by three out of points in a square, when the points are chosen to maximize this area?

In discrete geometry and discrepancy theory, the Heilbronn triangle problem asks how to place points in a region of the plane, such as a square, so that the smallest of the triangles formed by triples of the points is as large as possible. It is named after Hans Heilbronn, who conjectured that this largest achievable area shrinks at least as quickly as the inverse square of the number of points. Komlós, Pintz, and Szemerédi disproved the conjecture in 1982, finding placements whose smallest triangle is larger by a logarithmic factor, but the asymptotic growth rate of the area remains unknown.