A separation theorem for totally-sewn 4-polytopes
2015 ◽
Vol 52
(3)
◽
pp. 386-422
Keyword(s):
The Separation Problem, originally posed by K. Bezdek in [1], asks for the minimum number s(O, K) of hyperplanes needed to strictly separate an interior point O in a convex body K from all faces of K. It is conjectured that s(O, K) ≦ 2d in d-dimensional Euclidean space. We prove this conjecture for the class of all totally-sewn neighbourly 4-dimensional polytopes.
1953 ◽
Vol 49
(1)
◽
pp. 44-53
◽
Keyword(s):
2009 ◽
Vol 52
(3)
◽
pp. 361-365
◽
Keyword(s):
1962 ◽
Vol 58
(2)
◽
pp. 217-220
◽
Keyword(s):
1985 ◽
Vol 22
(03)
◽
pp. 710-716
◽
Keyword(s):
1972 ◽
Vol 14
(3)
◽
pp. 336-351
◽
2014 ◽
Vol 46
(04)
◽
pp. 919-936
◽
Keyword(s):
2018 ◽
Vol 50
(9)
◽
pp. 1-24
◽
Keyword(s):