Asset Details
Do you wish to reserve the book?
The Eisenlohr-Farris Algorithm for fully transitive polyhedra
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The Eisenlohr-Farris Algorithm for fully transitive polyhedra
Do you wish to request the book?
The Eisenlohr-Farris Algorithm for fully transitive polyhedra
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
The Eisenlohr-Farris Algorithm for fully transitive polyhedra
2023
Overview
The purpose of this note is to present a method for classifying three-dimensional polyhedra in terms of their symmetry groups. This method is constructive and it is described in terms of the conjugation classes of crystallographic groups in \\(\\mathbb{E}^3\\). For each class of groups \\(\\Gamma\\) the method can generate without duplication all polyhedra in three-dimensional space on which \\(\\Gamma\\) acts fully-transitively. It was proposed by J. M. Eisenlohr and S. L. Farris for generating every fully transitive polyhedra in \\(\\mathbb{E}^d\\). We also illustrate how the method can be applied in the euclidean space \\(\\mathbb{E}^3\\) by generating a new fully transitive polyhedron.
Publisher
Cornell University Library, arXiv.org
Subject
