Certain construction theorems are represented, which facilitate an inductive combinatorial construction of polytopes. That is, applying the constructions to a d-polytope with n vertices, given combinatorially, one gets many combinatorial d-polytopes-and polytopes only-with n+1 vertices. The constructions are strong enough to yield from the 4-simplex all the 1330 4-polytopes with up to 8 vertices.
|Number of pages||12|
|Journal||Israel Journal of Mathematics|
|State||Published - 1 Dec 1984|
ASJC Scopus subject areas
- Mathematics (all)