2000 character limit reached
Classification of tight regular polyhedra (1408.6703v2)
Published 28 Aug 2014 in math.CO
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.