regular polytopes stand at the end of more than two millennia of geometrical research, which began with regular polygons and polyhedra. They are highly symmetric combinatorial structures with distinctive geometric, algebraic, or topological properties, in many ways more fascinating than traditional regular polytopes and tessellations. The rapid development of the subject in the past 20 years has resulted in a rich new theory, featuring an attractive interplay of mathematical areas, including geometry, combinatorics, group theory, and topology. Abstract regular polytopes and their groups provide an appealing new approach to understanding geometric and combinatorial symmetry. This is the first comprehensive up-to-date account of the subject and its ramifications, and meets a critical need for such a text, because no book has been published in this area of classical and modern discrete geometry since Coxeter's Regular Polytopes (1948) and Regular Complex Polytopes (1974). The book should be of interest to researchers and graduate students in discrete geometry, combinatorics, and group theory.
In this paper we give a proof of the long‐standing Upper‐bound Conjecture for convex polytopes, which states that, for 1 ≤ j < d < v, the maximum possible number of j‐faces of a d‐polytope with v vertices is achieved by a cyclic polytope C(v, d).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.