Heilbronn conjectured that given arbitrary n points in the 2-dimensional unit square [0, 1]2, there must be three points which form a triangle of area at most O(1/n 2). This conjecture was disproved by a nonconstructive argument of Komlós, Pintz and Szemerédi [10] who showed that for every n there is a configuration of n points in the unit square [0, 1]2 where all triangles have area at least Ω(log n/n 2). Considering a generalization of this problem to dimensions d≥3, Barequet [3] showed for every n the existence of n points in the d-dimensional unit cube [0, 1]d such that the minimum volume of every simplex spanned by any (d+1) of these n points is at least Ω(1/n d). We improve on this lower bound by a logarithmic factor Θ(log n).
On Heilbronn’s Problem in Higher Dimension
- Original Paper
- Published:
- Volume 23, pages 669–680, (2003)
- Cite this article
-
86 Accesses
-
19 Citations