- Title
- More indecomposable polyhedra
- Creator
- Przesławski, Krzysztof; Yost, David
- Date
- 2016
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/168964
- Identifier
- vital:13924
- Identifier
- ISSN: 0213-8743
- Abstract
- We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a significant class of polytopes. We illustrate further the power of these techniques, compared with the traditional method of examining triangular faces, with several applications. In any dimension d 6= 2, we show that of all the polytopes with d2 + 1 2 d or fewer edges, only one is decomposable. In 3 dimensions, we complete the classification, in terms of decomposability, of the 260 combinatorial types of polyhedra with 15 or fewer edges.
- Publisher
- Instituto de Matemáticas de la Universidad de Extremadura
- Relation
- Extracta Mathematicae Vol. 31, no. 2 (2016), p. 169-188
- Rights
- Copyright Instituto de Matemáticas de la Universidad de Extremadura
- Rights
- Open Access
- Rights
- https://creativecommons.org/licenses/by-nc/3.0/legalcode
- Rights
- Copyright Creative Commons License Attribution-Non Commercial 3.0 Unported.
- Rights
- This metadata is freely available under a CCO license
- Subject
- Mathematics - Combinatorics; Mathematics - Metric Geometry; 52B10; 52B11 (Primary); 2005 Literary Studies; 52B05 (Secondary)
- Full Text
- Reviewed
- Hits: 466
- Visitors: 541
- Downloads: 104
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | UB Researc | 42 KB | Adobe Acrobat PDF | View Details Download |