Tight bounds on the expected number of holes in random point sets

Abstract

For integers d ≥ 2 and k ≥ d+1, a k-hole in a set S of points in general position in Rd is a k-tuple of points from S in convex position such that the interior of their convex hull does not contain any point from S. For a convex body K ⊂eq Rd of unit d-dimensional volume, we study the expected number EHKd,k(n) of k-holes in a set of n points drawn uniformly and independently at random from K. We prove an asymptotically tight lower bound on EHKd,k(n) by showing that, for all fixed integers d ≥ 2 and k≥ d+1, the number EHd,kK(n) is at least (nd). For some small holes, we even determine the leading constant n ∞n-dEHKd,k(n) exactly. We improve the currently best known lower bound on n ∞n-dEHKd,d+1(n) by Reitzner and Temesvari (2019). In the plane, we show that the constant n ∞n-2EHK2,k(n) is independent of K for every fixed k ≥ 3 and we compute it exactly for k=4, improving earlier estimates by Fabila-Monroy, Huemer, and Mitsche (2015) and by the authors (2020).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…