There are at most 2^{d+1}-2 neighbourly simplices in dimension d

arXiv1902.05597MaRDI QIDQ6314079FDOQ6314079

Authors: Andrzej Kisielewicz, Krzysztof Przesławski 

Publication date: 14 February 2019

Abstract: A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $mathbb{R}^d$, is presented.

This page was built for publication: There are at most $2^{d+1}-2$ neighbourly simplices in dimension $d$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314079)