Abstract
Imagine that randomly oriented objects in the shape of a regular n-sided polygon are moving on a conveyor. Our aim is to specify sequences composed of two different rigid motions which, when performed on these objects, will reposition them in all possible ways. We call such sequences facing sequences. (Expressed in group theoretical terms, a facing sequence in a group G is a sequence of elements a1, a2, ..., an from G such that G={e, a1, a1a2, ..., a1a2 ... an}). In this paper we classify various kinds of facing sequences and determine some of their properties. The arguments are group theoretical and combinatorial in nature.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 97-103 |
| Number of pages | 7 |
| Journal | Aequationes Mathematicae |
| Volume | 20 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1980 |
Keywords
- AMS (1970) subject classification: Primary 05A15, 20F05
Fingerprint
Dive into the research topics of 'Reorienting regular n-gons'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS