Separation in Simply Linked Neighbourly 4-Polytopes
Combinatorics
2017-03-14 v1
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.
Cite
@article{arxiv.1703.03803,
title = {Separation in Simply Linked Neighbourly 4-Polytopes},
author = {T. Bisztriczky},
journal= {arXiv preprint arXiv:1703.03803},
year = {2017}
}
Comments
6 figures