Completely classifying all vertex-transitive and edge-transitive polyhedra |
| |
Authors: | Steven L Farris |
| |
Institution: | (1) Department of Mathematical Sciences, Ball State University, 47306 Muncie, IN, U.S.A. |
| |
Abstract: | Recently A. Dress completed the classification of the regular polyhedra in E
3 by adding one class to the enumeration given by Grünbaum on this subject. This classification is the only systematic study of a collection of polyhedra possessing special symmetries which uses the generalized definition of a polygon allowing for skew polygons as well as planar polygons in E
3. This study gives necessary conditions for polyhedra to be vertex-transitive and edge-transitive. These conditions are restrictive enough to make the task of completely enumerating such polyhedra realizable and efficient. Examples of this process are given, and an explanation of the basic process is discussed. These new polyhedra are appearing more frequently in applications of geometry, and this examination is a beginning of the classifications of polyhedra having special symmetries even though there are many other such classes which lack this scrutiny. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|