On thek-systems of a simple polytope
Ak-system of the graphGP of a simple polytopeP is a set of induced subgraphs ofGP that shares certain properties with the set of subgraphs induced by thek-faces ofP. This new concept leads to polynomial-size certificates in terms ofGP for both the set of vertex sets of facets and for abstract objective functions (AOF) in the sense of Kalai. Moreover, it is proved that an acyclic orientation yields an AOF if and only if it induces a unique sink on every 2-face.
Unable to display preview. Download preview PDF.
- H. Achatz and P. Kleinschmidt,Reconstructing a simple polytope from its graph, inPolytopes—Combinatorics and Computation (G. Kalai and G. M. Ziegler, eds.), DMV Seminar Band, Vol. 29, Birkhäuser, Basel, 2000, pp. 155–165.Google Scholar
- M. Develin, e-mail conversation, Nov 2000, email@example.com.Google Scholar
- Ch. Haase and G. M. Ziegler,Examples and counterexamples for Perles’ conjecture, to appear in Discrete Computational Geometry.Google Scholar
- J. Richter-Gebert,Realization Spaces of Polytopes, Lecture Notes in Mathematics, Vol. 1643, Springer, Berlin, 1996.Google Scholar