Separation in Simply Linked Neighbourly 4-Polytopes
From MaRDI portal
Publication:6284189
arXiv1703.03803MaRDI QIDQ6284189FDOQ6284189
Authors: T. Bisztriczky 
Publication date: 9 March 2017
Abstract: The Separation Problem asks for the minimum number s(O,K) of hyperplanes required to strictly separate any interior point O of a convex body K from all faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real d-space , and we verify this for the class of simply linked neighbourly 4-polytopes.
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)
This page was built for publication: Separation in Simply Linked Neighbourly 4-Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284189)
