Construction theorems for polytopes

Amos Altshuler; Ido Shemer

doi:10.1007/BF02760509

Construction theorems for polytopes

Amos Altshuler, Ido Shemer

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	99-110
Number of pages	12
Journal	Israel Journal of Mathematics
Volume	47
Issue number	2-3
DOIs	https://doi.org/10.1007/BF02760509
State	Published - 1 Dec 1984

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/BF02760509

Cite this

@article{c7efcf09de9e4bdf9154a3b811f72904,

title = "Construction theorems for polytopes",

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.",

author = "Amos Altshuler and Ido Shemer",

year = "1984",

month = dec,

day = "1",

doi = "10.1007/BF02760509",

language = "English",

volume = "47",

pages = "99--110",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "2-3",

}

TY - JOUR

T1 - Construction theorems for polytopes

AU - Altshuler, Amos

AU - Shemer, Ido

PY - 1984/12/1

Y1 - 1984/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51249183377&partnerID=8YFLogxK

U2 - 10.1007/BF02760509

DO - 10.1007/BF02760509

M3 - Article

AN - SCOPUS:51249183377

SN - 0021-2172

VL - 47

SP - 99

EP - 110

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 2-3

ER -

Construction theorems for polytopes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this