Probability that n points are in convex position in a general convex polygon: Asymptotic results

Abstract

Let PK(n) be the probability that n points z1,…,zn picked uniformly and independently in K, a non-flat compact convex polygon in R2, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we give an equivalent of PK(n) when n∞. This improves on a famous result of Bárány (yet valid for a general convex domain K) and a result we initiated in the case where K is a regular convex polygon.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…