2000 character limit reached
Probability that $n$ points are in convex position in a general convex polygon: Asymptotic results
Published 15 Oct 2024 in math.PR and math.CO | (2410.11706v1)
Abstract: Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}2$, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we give an equivalent of $\mathbb{P}_K(n)$ when $n\to\infty$. This improves on a famous result of B\'ar\'any (yet valid for a general convex domain $K$) and a result we initiated in the case where $K$ is a regular convex polygon.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.