IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i5p381-d226256.html
   My bibliography  Save this article

Cutting Convex Polytopes by Hyperplanes

Author

Listed:
  • Takayuki Hibi

    (Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Toyonaka, Osaka 560-0043, Japan)

  • Nan Li

    (Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA)

Abstract

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.

Suggested Citation

  • Takayuki Hibi & Nan Li, 2019. "Cutting Convex Polytopes by Hyperplanes," Mathematics, MDPI, vol. 7(5), pages 1-14, April.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:5:p:381-:d:226256
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/5/381/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/5/381/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:5:p:381-:d:226256. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.