No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\) (Q2046444): Difference between revisions

A family of \(d\)-simplices in \({\mathbb R}^d\) is called \textit{nearly neighbourly} if every two members are separated by a hyperplane that contains a facet of each. In this paper it is shown that \(2^{d+1}-2\) is an upper bound for the cardinality of a nearly neighbourly family of \(d\)-simplices. The previous upper bound was \(2^{d+1}-1\).