Abstract
An abstract polytope is called regular if its automorphism group has a single orbit on flags (maximal chains). In this paper, the regular n-polytopes with the smallest number of flags are found, for every rank n>1. With a few small exceptions, the smallest regular n-polytopes come from a family of ‘tight’ polytopes with 2⋅4n−1 flags, one for each n, with Schläfli symbol {4∣4∣⋯∣4}. Also with few exceptions, these have both the smallest number of elements, and the smallest number of edges in their Hasse diagram.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
