Peter McMullen – författare

H.S.M. Coxeter is one of the world's best-known mathematicians who wrote several papers and books on geometry, algebra and topology, and finite mathematics. This book is being published in conjunction with the 50th anniversary of the Canadian Mathematical Society and it is a collection of 26 papers written by Dr. Coxeter.

Abstract 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.

The aim of this volume is to reinforce the interaction between the three main branches (abstract, convex and computational) of the theory of polytopes. The articles include contributions from many experts in the field, and their topics of concern are expositions of recent results and in-depth analyses of the development (past and future) of the subject. The subject matter of the book ranges from algorithms for assignment and transportation problems to the introduction of a geometric theory of polyhedra which need not be convex. With polytopes as the main topic of interest, there are articles on realizations, classifications, Eulerian posets, polyhedral subdivisions, generalized stress, the Brunn-Minkowski theory, asymptotic approximations and the computation of volumes and mixed volumes. This text should be of interest to researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels.

A valuable resource for researchers in discrete and combinatorial geometry, this book offers comprehensive coverage of several modern developments on algebraic and combinatorial properties of polytopes. The introductory chapters provide a new approach to the basic properties of convex polyhedra and how they are connected; for instance, fibre operations are treated early on. Finite tilings and polyhedral convex functions play an important role, and lead to the new technique of tiling diagrams. Special classes of polytopes such as zonotopes also have corresponding diagrams. A central result is the complete characterization of the possible face-numbers of simple polytopes. Tools used for this are representations and the weight algebra of mixed volumes. An unexpected consequence of the proof is an algebraic treatment of Brunn-Minkowski theory as applied to polytopes. Valuations also provide a thread running through the book, and the abstract theory and related tensor algebras are treated in detail.

Regular polytopes and their symmetry have a long history stretching back two and a half millennia, to the classical regular polygons and polyhedra. Much of modern research focuses on abstract regular polytopes, but significant recent developments have been made on the geometric side, including the exploration of new topics such as realizations and rigidity, which offer a different way of understanding the geometric and combinatorial symmetry of polytopes. This is the first comprehensive account of the modern geometric theory, and includes a wide range of applications, along with new techniques. While the author explores the subject in depth, his elementary approach to traditional areas such as finite reflexion groups makes this book suitable for beginning graduate students as well as more experienced researchers.

Regular polytopes and their symmetry have a long history stretching back two and a half millennia, to the classical regular polygons and polyhedra. Much of modern research focuses on abstract regular polytopes, but significant recent developments have been made on the geometric side, including the exploration of new topics such as realizations and rigidity, which offer a different way of understanding the geometric and combinatorial symmetry of polytopes. This is the first comprehensive account of the modern geometric theory, and includes a wide range of applications, along with new techniques. While the author explores the subject in depth, his elementary approach to traditional areas such as finite reflexion groups makes this book suitable for beginning graduate students as well as more experienced researchers.

The aim of this volume is to reinforce the interaction between the three main branches (abstract, convex and computational) of the theory of polytopes. The articles include contributions from many of the leading experts in the field, and their topics of concern are expositions of recent results and in-depth analyses of the development (past and future) of the subject. The subject matter of the book ranges from algorithms for assignment and transportation problems to the introduction of a geometric theory of polyhedra which need not be convex. With polytopes as the main topic of interest, there are articles on realizations, classifications, Eulerian posets, polyhedral subdivisions, generalized stress, the Brunn--Minkowski theory, asymptotic approximations and the computation of volumes and mixed volumes. For researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels.