- Title
- Some indecomposable polyhedra
- Creator
- Yost, David
- Date
- 2007
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60368
- Identifier
- vital:962
- Identifier
-
https://doi.org/10.1080/02331930701617304
- Identifier
- ISSN:0233-1934
- Abstract
- We complete the classification, in terms of decomposability, of all combinatorial types of polytopes with 14 or fewer edges. Recall that a polytope P is said to be decomposable if it is equal to a Minkowski sum [image omitted] of two polytopes Q and R which are not similar to P. Our main contribution here is to consider the 42 types of polyhedra with 8 faces and 8 vertices. It turns out that 34 of these are always indecomposable, and 5 are always decomposable. The remaining 3 are ambiguous, i.e. each of them has both decomposable and indecomposable geometric realizations.; C1
- Publisher
- Taylor & Francis
- Relation
- Optimization Vol. 56, no. 5-6 (2007), p. 715-724
- Rights
- Copyright Taylor & Francis
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Decomposable; Minkowski sums; Polyhedra; Polytopes
- Full Text
- Reviewed
- Hits: 740
- Visitors: 1088
- Downloads: 372
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted version | 263 KB | Adobe Acrobat PDF | View Details Download |