More indecomposable polyhedra
From MaRDI portal
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 , we show that of all the polytopes with 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.
Recommendations
Cited in
(12)- Minimum number of edges of polytopes with \(2d+2\) vertices
- Polytopes close to being simple
- Variational analysis down under open problem session
- Lower bound theorems for general polytopes
- Decompositions of a polygon into centrally symmetric pieces
- The excess degree of a polytope
- Some indecomposable polyhedra
- Deformation cones of hypergraphic polytopes
- Deformed graphical zonotopes
- Lower bound results for conditionally decomposable polytopes
- Polytopes with low excess degree
- Existence of polyhedra which cannot be decomposed into simplexes of equal volume
This page was built for publication: More indecomposable polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273316)