Asymptotic probability formula for conditioned convex hulls

Let K\mathbf{K} be a compact convex set of area 11, let λ>0\lambda>0, and let CC^\star be the unique element of argmaxΦλ,K\operatorname{argmax}\Phi_{\lambda,\mathbf{K}}, where

Φλ,K(C)=L(C)3A(C)λ.\Phi_{\lambda,\mathbf{K}}(C)={\sf L}(C)^3{\bf A}(C)^\lambda.

Let Qn,mK{\bf Q}^{\mathbf{K}}_{n,m} denote the probability that the convex hull of n+mn+m independent uniform points in K\mathbf{K} has nn vertices. Asymptotic probability conjecture. Under these hypotheses,

n1(log(Qn,nλK)+2nlog(n))log(e24(λ+1)λ+1λλA(C)λL(C)3).n^{-1}\left(\log\left({\bf Q}^{\mathbf{K}}_{n,\lfloor n\lambda\rfloor}\right)+2n\log(n)\right)\to\log\left(\frac{e^2}{4}\frac{(\lambda+1)^{\lambda+1}}{\lambda^\lambda}{\bf A}(C^\star)^\lambda{\sf L}(C^\star)^3\right).

This is presented as a conjectural asymptotic expansion for the conditioning probability; the subsequent convergence statement is explicitly made under its hypothesis.

Sources & referencesView supporting material

Primary source

Jean-François Marckert and Ludovic Morin, “Conditioning random points by the number of vertices of their convex hull: the bi-pointed case”, arXiv:2510.26330 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.