Constructing infinite families of regular incidence (quasi-)polytopes (Q1345121): Difference between revisions

Regular incidence (quasi-)polytopes are combinatorial structures which generalize ordinary regular convex polytopes. (In the language of the reviewer and \textit{F. Schulte} [for example, Math. Z. 201, 209-226 (1989; Zbl 0663.51007)], incidence polytopes are called abstract polytopes.) Let \({\mathcal P}\) be a regular incidence (quasi-)polytope, of type \(\{a_ 1, \dots, a_{n-1}\}\). The author shows that, if \({\mathcal P}\) permits its edges to be oriented and labelled by rationals so that the signed sum around any closed path is an integer, that sum around any 2-face is 0 or \(\pm 1\), and the group of \({\mathcal P}\) is transitive on those flags which contain a 2-face with such a sum \(\pm 1\), then for each integer \(m \geq 2\), there exists a regular incidence (quasi-)polytope of type \(\{ma_ 1, \dots, a_{n-1}\}\) with the same vertex-figure as \({\mathcal P}\).