View in EDS HTML Full Text PDF Full Text

On the Circuit Diameter Conjecture.

Saved in:
Bibliographic Details
Title: On the Circuit Diameter Conjecture.
Authors: Borgwardt, Steffen1 steffen.borgwardt@ucdenver.edu, Stephen, Tamon2 tamon@sfu.ca, Yusun, Timothy2 tyusun@sfu.ca
Source: Discrete & Computational Geometry. Oct2018, Vol. 60 Issue 3, p558-587. 30p.
Subjects: Polyhedra, Polyhedra models, Geometric modeling, Geometric surfaces, Diameter
Abstract: From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup (Acta Math 117:53-78, 1967), the Hirsch conjecture of an upper bound of f-d was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron U4 with eight facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos (Ann Math 176(1):383-412, 2012). We consider analogous properties for a variant of the combinatorial diameter called the circuit diameter. In this variant, the walks are built from the circuit directions of the polyhedron, which are the minimal non-trivial solutions to the system defining the polyhedron. We are able to prove that circuit variants of the so-called non-revisiting conjecture and d-step conjecture both imply the circuit analogue of the Hirsch conjecture. For the equivalences in Klee and Walkup, the wedge construction was a fundamental proof technique. We exhibit why it is not available in the circuit setting, and what are the implications of losing it as a tool. Further, we show the circuit analogue of the non-revisiting conjecture implies a linear bound on the circuit diameter of all unbounded polyhedra—in contrast to what is known for the combinatorial diameter. Finally, we give two proofs of a circuit version of the 4-step conjecture. These results offer some hope that the circuit version of the Hirsch conjecture may hold, even for unbounded polyhedra. A challenge in the circuit setting is that different realizations of polyhedra with the same combinatorial structure may have different diameters. We adapt the notion of simplicity to work with circuits in the form of C-simple and wedge-simple polyhedra. We show that it suffices to consider such polyhedra for studying circuit analogues of the Hirsch conjecture. [ABSTRACT FROM AUTHOR]
Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Description
Abstract:From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup (Acta Math 117:53-78, <xref>1967</xref>), the Hirsch conjecture of an upper bound of f-d<inline-graphic></inline-graphic> was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron U4<inline-graphic></inline-graphic> with eight facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos (Ann Math 176(1):383-412, <xref>2012</xref>). We consider analogous properties for a variant of the combinatorial diameter called the circuit diameter. In this variant, the walks are built from the circuit directions of the polyhedron, which are the minimal non-trivial solutions to the system defining the polyhedron. We are able to prove that circuit variants of the so-called non-revisiting conjecture and d-step conjecture both imply the circuit analogue of the Hirsch conjecture. For the equivalences in Klee and Walkup, the wedge construction was a fundamental proof technique. We exhibit why it is not available in the circuit setting, and what are the implications of losing it as a tool. Further, we show the circuit analogue of the non-revisiting conjecture implies a linear bound on the circuit diameter of all unbounded polyhedra—in contrast to what is known for the combinatorial diameter. Finally, we give two proofs of a circuit version of the 4-step conjecture. These results offer some hope that the circuit version of the Hirsch conjecture may hold, even for unbounded polyhedra. A challenge in the circuit setting is that different realizations of polyhedra with the same combinatorial structure may have different diameters. We adapt the notion of simplicity to work with circuits in the form of C<inline-graphic></inline-graphic>-simple and wedge-simple polyhedra. We show that it suffices to consider such polyhedra for studying circuit analogues of the Hirsch conjecture. [ABSTRACT FROM AUTHOR]
ISSN:01795376
DOI:10.1007/s00454-018-9995-y