Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-23T19:39:23.109Z Has data issue: false hasContentIssue false
  • English
  • Français

An indecomposable polytope all of whose facets are decomposable

Published online by Cambridge University Press:  26 February 2010

Zeev Smilansky
Zeev Smilansky
Affiliation:
Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, Givot Ram, 91904 Jerusalem, Israel.
Get access

Extract

A (convex) d-polytope is the convex hull of a finite set of points in Euclidean d–space Ed. The (Minkowski) sum of two polytopes P1 and P2 is defined by

.

Type
Research Article
Information
Mathematika , Volume 33 , Issue 2 , December 1986 , pp. 192 - 196
Copyright
Copyright © University College London 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Grünbaum, B.. Convex Polytopes (Wiley Interscience, 1967).Google Scholar
2.Kallay, M.. Indecomposable Polytopes. Israel J. Math., 41 (1982), 235–243.CrossRefGoogle Scholar
3.Kallay, M.. Decomposability of Convex Polytopes. Ph.D. dissertation, Hebrew University of Jerusalem, 1979 (Hebrew, with English summary).Google Scholar
4.Meyer, W. J.. Indecomposable Polytopes. Trans. Amer. Math. Soc., 190 (1974), 77–86.CrossRefGoogle Scholar
5.Shephard, G. C.. Decomposable Convex Polyhedra. Mathematika, 10 (1963), 89–95.CrossRefGoogle Scholar
6.Smilansky, Z.. Decomposability of Polytopes and Polyhedra, Ph.D. dissertation, Hebrew University of Jerusalem, 1986 (Hebrew, with English summary).CrossRefGoogle Scholar
7.Smilansky, Z.. Decomposability of Polytopes and Polyhedra. To appear in Geometriae Dedicata.Google Scholar