Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 99-110 |
| Number of pages | 12 |
| Journal | Israel Journal of Mathematics |
| Volume | 47 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - 1 Dec 1984 |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Construction theorems for polytopes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver