3 research outputs found

    Upper bounds for Heilbronn's triangle problem in higher dimensions

    Full text link
    We 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 d1d \ge 1, any subset of [0,1]d[0, 1]^d of size nn contains: - d+1d+1 points which span a simplex of volume at most Cdnlogd+6C_d n^{-\log d+ 6}, - 1.3d1.3 d points whose convex hull has volume at most Cdn1.1C_d n^{-1.1}, - k+14dk + 1\ge 4\sqrt{d} points which span a kk-dimensional simplex of volume at most Cdnkdk28d2C_d n^{-\frac{k}{d} - \frac{k^2}{8d^2}}.Comment: 10 pages, a significant update with new result

    Part I:

    Get PDF
    corecore