FREE SHIPPING on Orders of $40 or More!
An Introduction to Convex Polytopes

The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. All the background information on convex sets and convex polytopes which is m~eded to under­ stand and appreciate these three theorems is developed in detail. This background material also forms a basis for studying other aspects of polytope theory. The Dehn-Sommerville Relations are classical, whereas the proofs of the Upper Bound Theorem and the Lower Bound Theorem are of more recent date: they were found in the early 1970's by P. McMullen and D. Barnette, respectively. A famous conjecture of P. McMullen on the charac­ terization off-vectors of simplicial or simple polytopes dates from the same period; the book ends with a brief discussion of this conjecture and some of its relations to the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. However, the recent proofs that McMullen's conditions are both sufficient (L. J. Billera and C. W. Lee, 1980) and necessary (R. P. Stanley, 1980) go beyond the scope of the book. Prerequisites for reading the book are modest: standard linear algebra and elementary point set topology in [R1d will suffice.

1101516080
An Introduction to Convex Polytopes

The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. All the background information on convex sets and convex polytopes which is m~eded to under­ stand and appreciate these three theorems is developed in detail. This background material also forms a basis for studying other aspects of polytope theory. The Dehn-Sommerville Relations are classical, whereas the proofs of the Upper Bound Theorem and the Lower Bound Theorem are of more recent date: they were found in the early 1970's by P. McMullen and D. Barnette, respectively. A famous conjecture of P. McMullen on the charac­ terization off-vectors of simplicial or simple polytopes dates from the same period; the book ends with a brief discussion of this conjecture and some of its relations to the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. However, the recent proofs that McMullen's conditions are both sufficient (L. J. Billera and C. W. Lee, 1980) and necessary (R. P. Stanley, 1980) go beyond the scope of the book. Prerequisites for reading the book are modest: standard linear algebra and elementary point set topology in [R1d will suffice.

85.34 Out Of Stock
An Introduction to Convex Polytopes

An Introduction to Convex Polytopes

by Arne Brondsted
An Introduction to Convex Polytopes

An Introduction to Convex Polytopes

by Arne Brondsted

Overview

The aim of this book is to introduce the reader to the fascinating world of convex polytopes. The highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. All the background information on convex sets and convex polytopes which is m~eded to under­ stand and appreciate these three theorems is developed in detail. This background material also forms a basis for studying other aspects of polytope theory. The Dehn-Sommerville Relations are classical, whereas the proofs of the Upper Bound Theorem and the Lower Bound Theorem are of more recent date: they were found in the early 1970's by P. McMullen and D. Barnette, respectively. A famous conjecture of P. McMullen on the charac­ terization off-vectors of simplicial or simple polytopes dates from the same period; the book ends with a brief discussion of this conjecture and some of its relations to the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem. However, the recent proofs that McMullen's conditions are both sufficient (L. J. Billera and C. W. Lee, 1980) and necessary (R. P. Stanley, 1980) go beyond the scope of the book. Prerequisites for reading the book are modest: standard linear algebra and elementary point set topology in [R1d will suffice.

Product Details

ISBN-13: 9781461270232
Publisher: Springer New York
Publication date: 09/30/2012
Series: Graduate Texts in Mathematics Series , #90
Edition description: Softcover reprint of the original 1st ed. 1983
Pages: 162
Product dimensions: 6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

1 Convex Sets.- •1. The Affine Structure of—d.- �A7;2. Convex Sets.- •3. The Relative Interior of a Convex Set.- •4. Supporting Hyperplanes and Halfspaces.- •5. The Facial Structure of a Closed Convex Set.- •6. Polarity.- 2 Convex Polytopes.- •7. Polytopes.- •8. Polyhedral Sets.- •9. Polarity of Polytopes and Polyhedral Sets.- •10. Equivalence and Duality of Polytopes.- •11. Vertex-Figures.- •12. Simple and Simplicial Polytopes.- •13. Cyclic Polytopes.- •14. Neighbourly Polytopes.- •15. The Graph of a Polytope.- 3 Combinatorial Theory of Convex Polytopes.- •16. Euler's Relation.- •17. The Dehn-Sommerville Relations.- •18. The Upper Bound Theorem.- •19. The Lower Bound Theorem.- •20. McMullen's Conditions.- Appendix 1 Lattices.- Appendix 2 Graphs.- Appendix 3 Combinatorial Identities.- Bibliographical Comments.- List of Symbols.

From the B&N Reads Blog
Page 1 of

Customer Reviews