Stars of empty simplices
From MaRDI portal
Abstract: Let be an -element point set in general position. For a -element subset let the degree be the number of empty simplices containing no other point of . The -degree of the set , denoted , is defined as the maximum degree over all -element subset of . We show that if is a random point set consisting of independently and uniformly chosen points from a compact set then , improving results previously obtained by B'ar'any, Marckert and Reitzner [Many empty triangles have a common edge, Discrete Comput. Geom., 2013] and Temesvari [Moments of the maximal number of empty simplices of a random point set, Discrete Comput. Geom., 2018] and giving the correct order of magnitude with a significantly simpler proof. Furthermore, we investigate . In the case we prove that .
Recommendations
Cites work
- scientific article; zbMATH DE number 3905681 (Why is no real title available?)
- scientific article; zbMATH DE number 1786502 (Why is no real title available?)
- scientific article; zbMATH DE number 881170 (Why is no real title available?)
- Empty Simplices in Euclidean Space
- Gaussian polytopes: variances and limit theorems
- Many empty triangles have a common edge
- Martingale inequalities and the jackknife estimate of variance
- Moments of the maximal number of empty simplices of a random point set
- Planar point sets with a small number of empty convex polygons
- Random polytopes
- Rates of Poisson convergence for U-statistics
- Research Problems in Discrete Geometry
- Short distances, flat triangles and Poisson limits
- Stochastic and Integral Geometry
- Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables
This page was built for publication: Stars of empty simplices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200587)