Abstract
We show that an isomorphism between the graphs of two simple polytopes of arbitrary dimension can always be extended to an isomorphism between the polytopes themselves. It has been convenient to study the dual situation, involving what we like to call the puzzle of a simplicial polytope.
Similar content being viewed by others
References
Alexandroff, P. undHopf, H.,Topologie. Springer, Berlin, 1935.
Blind, G. undBlind, R.,Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. Manuskript, 1986.
Bruggesser, H. andMani, P.,Shellable decomposition of cells and spheres. Math. Scand.29 (1972), 197–205.
Dold, A.,Lectures on algebraic topology. Springer, Berlin—Heidelberg—New York, 1972.
Ewald, G., Kleinschmidt, P., Pachner, U. andSchulz, Ch.,Neuere Entwicklungen in der kombinatorischen Konvexgeometrie. In: Proceedings of the Geometry Symposium in Siegen, 1978. J. Tölke and J. M. Wills, editors. Birkhäuser, Basel—Boston—Stuttgart, 1979.
Grünbaum, B.,Convex polytopes. Interscience, New York, 1967.
Mani, P.,Spheres with few vertices. J. Comb. Theory Ser. A13 (1972), 346–352.
Perles, M. A., Conversations at the Oberwolfach meetings on convex bodies, 1984, 1986.
Schemer, I.,Neighborly polytopes. Israel J. Math.43 (1982), 291–314.
Schöne, W.,Einfache, konvexe Polytope und ihre Graphen. Beitr. Geom. Algebra.19 (1985), 145–157.
Spanier, E.,Algebraic topology. McGraw-Hill, New York, 1966.
Author information
Authors and Affiliations
Additional information
Dedicated to Professor Otto Haupt with best wishes on his 100th birthday.
Rights and permissions
About this article
Cite this article
Blind, R., Mani-Levitska, P. Puzzles and polytope isomorphisms. Aeq. Math. 34, 287–297 (1987). https://doi.org/10.1007/BF01830678
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01830678