Skip to main content
Log in

Simpler Tests for Semisparse Subgroups

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael I. Hartley.

Additional information

Received February 15, 2005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartley, M.I. Simpler Tests for Semisparse Subgroups. Ann. Comb. 10, 343–352 (2006). https://doi.org/10.1007/s00026-006-0292-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-006-0292-8

AMS Subject Classification.

Keywords.

Navigation