Construction theorems for polytopes

Amos Altshuler, Ido Shemer

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

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 languageEnglish
Pages (from-to)99-110
Number of pages12
JournalIsrael Journal of Mathematics
Volume47
Issue number2-3
DOIs
StatePublished - 1 Dec 1984

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Construction theorems for polytopes'. Together they form a unique fingerprint.

Cite this