Some infinite families of finite incidence-polytopes

Using a certain class of maps, derived from regular tessellations by specifying the length of its Petrie polygons, we construct infinite families 4{2 n, 4, 3} 6, 4{4, 2 n, 3} 6, 4{4, 2 n, 4} 4, 6{3, 2 n, 3} 6 and 4{3, 3, 2 n} 6 of finite regular incidence-polytopes.

Saved in:
Bibliographic Details
Published inJournal of combinatorial theory. Series A Vol. 55; no. 1; pp. 60 - 73
Main Author Weiss, Asia Ivić
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 01.09.1990
Academic Press
Subjects
Combinatorics
Combinatorics. Ordered structures
Designs and configurations
Exact sciences and technology
Mathematics
Sciences and techniques of general use
Polytope
Construction
Partially ordered set
Combinatorial geometry
Group theory
Incidence
Online AccessGet full text

Cover

More Information
Summary:Using a certain class of maps, derived from regular tessellations by specifying the length of its Petrie polygons, we construct infinite families 4{2 n, 4, 3} 6, 4{4, 2 n, 3} 6, 4{4, 2 n, 4} 4, 6{3, 2 n, 3} 6 and 4{3, 3, 2 n} 6 of finite regular incidence-polytopes.
ISSN:0097-3165
1096-0899
DOI:10.1016/0097-3165(90)90047-Z