Cutting convex polytopes by hyperplanes

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the original polytope are hereditary to its subpolytopes obtained by a cut. In this work, we devote our attenti...

Full description

Bibliographic Details
Main Authors: Hibi, Takayuki (Author), Li, Nan (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Multidisciplinary Digital Publishing Institute, 2020-05-20T20:14:43Z.
Subjects:
Online Access:Get fulltext
Description
Summary:Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the original polytope are hereditary to its subpolytopes obtained by a cut. In this work, we devote our attention to all the separating hyperplanes for some given polytope (integral and convex) and study the existence and classification of such hyperplanes. We prove the existence of separating hyperplanes for the order and chain polytopes for any finite posets that are not a single chain, and prove there are no such hyperplanes for any Birkhoff polytopes. Moreover, we give a complete separating hyperplane classification for the unit cube and its subpolytopes obtained by one cut, together with some partial classification results for order and chain polytopes. Keywords: separating hyperplane; order polytopes; chain polytopes; Birkhoff polytopes