Papers
Topics
Authors
Recent
Search
2000 character limit reached

Classification of tight regular polyhedra

Published 28 Aug 2014 in math.CO | (1408.6703v2)

Abstract: A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which values of p and q there is a tight non-orientably regular polyhedron of type {p, q}. Furthermore, we completely classify tight regular polyhedra in terms of their automorphism groups.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.