1 problem

Let $d\geq 4$, let $k\leq d$, and let $\mathrm{C}(d,k,n)$ denote the maximum, over all $k$-vertex simplices $S$ and all $n$-element sets $P\subseteq\mathbb{R}^d$, of the number of…