Affiliation:
1. Department of Mathematics Massachusetts Institute of Technology Cambridge Massachusetts USA
Abstract
AbstractWe develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed , any subset of of size contains
points that span a simplex of volume at most ,
points whose convex hull has volume at most ,
points that span a ‐dimensional simplex of volume at most .
Reference14 articles.
1. A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
2. Large k‐D simplices in the d‐dimensional unit cube;Barequet G.;Far East J. Appl. Math.,2006
3. An Algorithm for Heilbronn's Problem
4. An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
5. A.Cohen C.Pohoata andD.Zakharov A new upper bound for the Heilbronn triangle problem arXiv:2305.18253 2023.