More indecomposable polyhedra

DSpace/Manakin Repository

español português english

More indecomposable polyhedra

Show full item record

Title: More indecomposable polyhedra
Author: PrzesŁawski, Krzysztof; Yost, David
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≠2, we show that of all the polytopes with d^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.
Date: 2016

Files in this item

Files Size Format View
2605-5686_31_2_169.pdf 334.2Kb PDF View  Thumbnail

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Attribution-NonCommercial 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial 4.0 International

Search DSpace


My Account



Redes sociales