IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v21y2013i3p426-460.html
   My bibliography  Save this article

Recent progress on the combinatorial diameter of polytopes and simplicial complexes

Author

Listed:
  • Francisco Santos

Abstract

The Hirsch Conjecture, posed in 1957, stated that the graph of a d-dimensional polytope or polyhedron with n facets cannot have diameter greater than n−d. The conjecture itself has been disproved, but what we know about the underlying question is quite scarce. Most notably, no polynomial upper bound is known for the diameters that were conjectured to be linear. In contrast, no polyhedron violating the conjecture by more than 25 % is known. This paper reviews several recent attempts and progress on the question. Some work is in the world of polyhedra or (more often) bounded polytopes, but some try to shed light on the question by generalizing it to simplicial complexes. In particular, we include here our recent and previously unpublished proof that the maximum diameter of arbitrary simplicial complexes is in n Θ(d) , and we summarize the main ideas in the polymath 3 project, a web-based collective effort trying to prove an upper bound of type nd for the diameters of polyhedra and of more general objects (including, e.g., simplicial manifolds). Copyright Sociedad de Estadística e Investigación Operativa 2013

Suggested Citation

  • Francisco Santos, 2013. "Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 426-460, October.
    • Handle: RePEc:spr:topjnl:v:21:y:2013:i:3:p:426-460
    DOI: 10.1007/s11750-013-0295-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-013-0295-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-013-0295-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jesús A. De Loera & Steven Klee, 2012. "Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 670-674, November.
    2. Michael J. Todd, 1980. "The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4," Mathematics of Operations Research, INFORMS, vol. 5(4), pages 599-601, November.
    3. J. Scott Provan & Louis J. Billera, 1980. "Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra," Mathematics of Operations Research, INFORMS, vol. 5(4), pages 576-594, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tamás Terlaky, 2013. "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 461-467, October.
    2. Jesús Loera, 2013. "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 474-481, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jesús A. De Loera & Steven Klee, 2012. "Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 670-674, November.
    2. Karim A. Adiprasito & Bruno Benedetti, 2014. "The Hirsch Conjecture Holds for Normal Flag Complexes," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1340-1348, November.
    3. Yasuko Matsui & Noriyoshi Sukegawa & Ping Zhan, 2023. "Monotone Diameter of Bisubmodular Polyhedra," SN Operations Research Forum, Springer, vol. 4(4), pages 1-16, December.
    4. David Avis & Bohdan Kaluzny, 2008. "Computing monotone disjoint paths on polytopes," Journal of Combinatorial Optimization, Springer, vol. 16(4), pages 328-343, November.

    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:spr:topjnl:v:21:y:2013:i:3:p:426-460. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.