A lower bound for Heilbronn's triangle-problem

Gabor Ellmann

公開日: 2017/3/8

Abstract

Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has an area not larger than O(n^-2). Here is shown a construction of a set of n points on a unit circle where any of the triangles have an area not less than O(n^-3/2 * (log n)^-7/2).

A lower bound for Heilbronn's triangle-problem | SummarXiv | SummarXiv