Annals of Combinatorics

, Volume 10, Issue 3, pp 343–352

Simpler Tests for Semisparse Subgroups


DOI: 10.1007/s00026-006-0292-8

Cite this article as:
Hartley, M.I. Ann. Comb. (2006) 10: 343. doi:10.1007/s00026-006-0292-8


The main results of this article facilitate the search for quotients of regular abstract polytopes. A common approach in the study of abstract polytopes is to construct polytopes with specified facets and vertex figures. Any nonregular polytope \( \mathcal{Q} \) may be constructed as a quotient of a regular polytope \( \mathcal{P} \) by a (so-called) semisparse subgroup of its automorphism group W (which will be a string C-group). It becomes important, therefore, to be able to identify whether or not a given subgroup N of a string C-group W is semisparse. This article proves a number of properties of semisparse subgroups. These properties may be used to test for semisparseness in a way which is computationally more efficient than previous methods. The methods are used to find an example of a section regular polytope of type {6, 3, 3} whose facets are Klein bottles.

AMS Subject Classification.



abstract polytopequotient polytopesemisparse subgroupklein bottle

Copyright information

© Birkhäuser Verlag, Basel 2006

Authors and Affiliations

  1. 1.Faculty of Engineering and Computer ScienceUniversity of Nottingham Malaysia CampusSelangorMalaysia