English

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

Combinatorics 2022-02-08 v2 Computational Geometry Discrete Mathematics Probability

Abstract

For integers d2d \geq 2 and kd+1k \geq d+1, a kk-hole in a set SS of points in general position in Rd\mathbb{R}^d is a kk-tuple of points from SS in convex position such that the interior of their convex hull does not contain any point from SS. For a convex body KRdK \subseteq \mathbb{R}^d of unit dd-dimensional volume, we study the expected number EHd,kK(n)EH^K_{d,k}(n) of kk-holes in a set of nn points drawn uniformly and independently at random from KK. We prove an asymptotically tight lower bound on EHd,kK(n)EH^K_{d,k}(n) by showing that, for all fixed integers d2d \geq 2 and kd+1k\geq d+1, the number EHd,kK(n)EH_{d,k}^K(n) is at least Ω(nd)\Omega(n^d). For some small holes, we even determine the leading constant limnndEHd,kK(n)\lim_{n \to \infty}n^{-d}EH^K_{d,k}(n) exactly. We improve the currently best known lower bound on limnndEHd,d+1K(n)\lim_{n \to \infty}n^{-d}EH^K_{d,d+1}(n) by Reitzner and Temesvari (2019). In the plane, we show that the constant limnn2EH2,kK(n)\lim_{n \to \infty}n^{-2}EH^K_{2,k}(n) is independent of KK for every fixed k3k \geq 3 and we compute it exactly for k=4k=4, improving earlier estimates by Fabila-Monroy, Huemer, and Mitsche (2015) and by the authors (2020).

Keywords

Cite

@article{arxiv.2111.12533,
  title  = {Tight bounds on the expected number of holes in random point sets},
  author = {Martin Balko and Manfred Scheucher and Pavel Valtr},
  journal= {arXiv preprint arXiv:2111.12533},
  year   = {2022}
}