Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T07:40:37.810Z Has data issue: false hasContentIssue false

Petrie Schemes

Published online by Cambridge University Press:  20 November 2018

Gordon Williams*
Affiliation:
Moravian College, Department of Mathematics and Computer Science, Room 219 Priscilla Payne Hurd Academic Complex, Bethlehem, Pennsylvania 18018, U.S.A., e-mail: gordon@moravian.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Petrie polygons, especially as they arise in the study of regular polytopes and Coxeter groups, have been studied by geometers and group theorists since the early part of the twentieth century. An open question is the determination of which polyhedra possess Petrie polygons that are simple closed curves. The current work explores combinatorial structures in abstract polytopes, called Petrie schemes, that generalize the notion of a Petrie polygon. It is established that all of the regular convex polytopes and honeycombs in Euclidean spaces, as well as all of the Grünbaum–Dress polyhedra, possess Petrie schemes that are not self-intersecting and thus have Petrie polygons that are simple closed curves. Partial results are obtained for several other classes of less symmetric polytopes.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2005