Skip to main content Accessibility help
×
Home

An indecomposable polytope all of whose facets are decomposable

  • Zeev Smilansky (a1)

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

.

Copyright

References

Hide All
1.Grünbaum, B.. Convex Polytopes (Wiley Interscience, 1967).
2.Kallay, M.. Indecomposable Polytopes. Israel J. Math., 41 (1982), 235243.
3.Kallay, M.. Decomposability of Convex Polytopes. Ph.D. dissertation, Hebrew University of Jerusalem, 1979 (Hebrew, with English summary).
4.Meyer, W. J.. Indecomposable Polytopes. Trans. Amer. Math. Soc., 190 (1974), 7786.
5.Shephard, G. C.. Decomposable Convex Polyhedra. Mathematika, 10 (1963), 8995.
6.Smilansky, Z.. Decomposability of Polytopes and Polyhedra, Ph.D. dissertation, Hebrew University of Jerusalem, 1986 (Hebrew, with English summary).
7.Smilansky, Z.. Decomposability of Polytopes and Polyhedra. To appear in Geometriae Dedicata.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed