On the expected number of \(k\)-sets (Q1327450)

Let \(X\) be a set of \(n\) points in \(\mathbb{R}^ d\) in general position. The simplex \(\text{conv} (S)\) (when \(S \subset X\) and \(| S | = d)\) is called a \(k\)-simplex if \(X\) has exactly \(k\) points on one side of the hyperplane \(\text{aff} (S)\). Most of the previous work has focused on the study of the maximum number of \(k\)-simplices over all configurations \(X\). The authors study \(E_ d (k,n)\), the expected number of \(k\)- simplices, when \(X\) is a sample of \(n\) random points from a probability distribution \(P\) on \(\mathbb{R}^ d\). If \(P\) is spherically symmetric, then \(E_ d (k,n) \leq cn^{d - 1}\) with a constant \(c\) depending only on \(d\). Further only the planar case \((d=2)\) is treated. When \(P\) is uniform on a convex body \(K \subset \mathbb{R}^ 2\) it is shown that \(E_ 2 (k,n)\) is asymptotically the expected number of vertices of the convex hull of \(S\). Finally, an example of a distribution with a larger \(E_ 2 (k,n) \sim cn \log n\) is given.