Abstract
We study the complexity of determining whether a polytope given by its vertices or facets is combinatorially isomorphic to its polar dual. We prove that this problem is Graph Isomorphism hard, and that it is Graph Isomorphism complete if and only if Vertex Enumeration is Graph Isomorphism easy. To the best of our knowledge, this is the first problem that is not equivalent to Vertex Enumeration and whose complexity status has a non-trivial impact on the complexity of Vertex Enumeration irrespective of whether checking Self-duality turns out to be strictly harder than Graph Isomorphism or equivalent to Graph Isomorphism. The constructions employed in the proof yield a class of self-dual polytopes that are interesting on their own. In particular, this class of self-dual polytopes has the property that the facet-vertex incident matrix of the polytope is transposable if and only if the matrix is symmetrizable as well. As a consequence of this construction, we also prove that checking self-duality of a polytope, given by its facet-vertex incidence matrix, is Graph Isomorphism complete, thereby answering a question of Kaibel and Schwartz.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Archdeacon D., Negami S.: The construction of self-dual projective polyhedra. J. Comb. Theory. Ser. B 59(1), 122–131 (1993)
Avis D., Bremner D., Seidel R.: How good are convex hull algorithms?. Comput. Geom 7, 265–301 (1997)
Boros, E.; Gurvich, V.; Zverovich, I.: Neighborhood hypergraphs of bipartite graphs. Technical report, Rutgers Center for Operations Research, 2006
Bremner D., Fukuda K., Marzetta A.: Primal-dual methods for vertex and facet enumeration. Discrete Comput. Geom. 20(3), 333–357 (1998)
Erickson, J.: Faces of intricate polytopes. Notes on the Web: http://compgeom.cs.uiuc.edu/jeffe/open/intricate.html. (2000)
Freund M.R., Orlin B.J.: On the complexity of four polyhedral set containment problems. Math. Progr. 33(2), 139–145 (1985)
Grünbaum, B.: Convex Polytopes Second Edition prepared by V. Kaibel, V. L. Klee and G. M. Ziegler, vol. 221 of Graduate Texts in Mathematics. Springer (2003)
Grünbaum B., Shephard C.G.: Is self-duality involutory?. Am. Math. Monthly 95, 729–733 (1988)
Jendrol S.: A non-involutory selfduality. Discrete Math. 74(3), 325–326 (1989)
Kaibel V., Pfetsch E.M.: Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom 23(3), 281–290 (2002)
Kaibel V., Schwartz A.: On the complexity of polytope isomorphism problems. Graphs Combinator. 19(2), 215–230 (2003)
Khachiyan L., Boros E., Borys K., Elbassioni M.K., Gurvich V.: Generating all vertices of a polyhedron is hard. Discrete Comput. Geom. 39(1-3), 174–190 (2008)
McMullen P.: The maximum numbers of faces of a convex polytope. Mathematica. 17, 179–184 (1970)
Tiwary R.H.: On the hardness of computing intersection, union and minkowski sum of polytopes. Discrete Comput. Geom. 40(3), 469–479 (2008)
Ziegler, M.G.: Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tiwary, H.R., Elbassioni, K. Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. Graphs and Combinatorics 30, 729–742 (2014). https://doi.org/10.1007/s00373-013-1299-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-013-1299-7