Abstract
In this paper decomposability of polytopes (and polyhedral sets) is studied by investigating the space of affine dependences of the vertices of the dual polytope. This turns out to be a fruitful approach and leads to several new results, as well as to simpler proofs and generalizations of known results. One of the new results is that a 3-polytope with more vertices than facets is decomposable; this leads to a characterization of the decomposability of 3-polytopes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grünbaum, B., Convex Polytopes, Wiley Interscience, (1967).
Kallay, M., ‘Indecomposable Polytopes’, Israel J. Math. 41 (1982), No. 3, 235–243.
Kallay, M., ‘Decomposability of Convex Polytopes’, Ph.D. Dissertation, Hebrew University of Jerusalem, 1979 (Hebrew, with English summary).
McMullen, P., ‘Representation of Polytopes and Polyhedral Sets’, Geom. Dedicata 2 (1973), 83–99.
McMullen, P. and Shephard, G. C., ‘Convex Polytopes and the Upper Bound Conjecture’, L.M.S. Lecture Note Series 3, Cambridge Univ. Press, 1971.
Meyer, W. J., ‘Indecomposable Polytopes’, Trans. Amer. Math. Soc. 190 (1974), 77–86.
Shephard, G. C., ‘Decomposable Convex Polyhedra’, Mathematika 10 (1963), 89–95.
Smilansky, Z., ‘Decomposability of Polytopes and Polyhedra’, Ph.D. Dissertation, Hebrew University of Jerusalem, 1986 (Hebrew, with English summary).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Smilansky, Z. Decomposability of polytopes and polyhedra. Geom Dedicata 24, 29–49 (1987). https://doi.org/10.1007/BF00159746
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00159746