scientific article; zbMATH DE number 1305394

zbMATH Open0951.52009MaRDI QIDQ4252275

Gill Barequet

Publication date: 3 January 2001

Title of this publication is not available (Why is that?)

zbMATH Keywords

unit cubeprobabilistic methodHeilbronn's triangle problemmoment curvesimplex volume

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Related Items (2)

An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem ⋮ Generalizations of Heilbronn's Triangle Problem

Recommendations

• Generalizations of Heilbronn's triangle problem 👍 👎
• A lower bound on the number of triangulations of planar point sets 👍 👎
• The on-line Heilbronn's triangle problem in \(d\) dimensions 👍 👎
• A lower bound for Heilbronn's triangle problem in \(d\) dimensions 👍 👎
• An improved lower bound on the minimum number of triangulations 👍 👎
• Generalizations of Heilbronn's Triangle Problem 👍 👎
• The On-Line Heilbronn’s Triangle Problem in d Dimensions 👍 👎
• Lower bounds on the number of triangles in a graph 👍 👎
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem 👍 👎
• Heilbronn triangle‐type problems in the unit square [0,1²] 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252275)