Proceedings ...: Convexity and applications; lectures by B. Grünbaum and V. KleeLincoln K. Durst Committee on the Undergraduate Program in Mathematics, Mathematical Association of America, 1967 - Geometry |
Contents
INTRODUCTION | 1 |
CONVEX SETS AND THE COMBINATORIAL | 43 |
but they are rather meant to supply a foundation for the combinatorial theory | 45 |
Copyright | |
3 other sections not shown
Common terms and phrases
3-connected 3-realizable 3-valent A₁ affine hull affinely independent algebra assume barycentric coordinates bound conjecture Branko Grünbaum closed convex set closed halfspaces column compact convex set concave concave function contains conv ext convex combination convex hull convex polytopes convex subset cyclic polytopes d-dimensional d-polytope defined Dehn-Sommerville equations denote dimension discussion disjoint equivalent Euler's formula example exists exposed points extreme points F₁ finite function Grünbaum H₂ halfspaces Helly's theorem hyperplane H i-face implies induction interior intersection interval graph k-face K₁ and K₂ Klee lectures Lemma line-free mathematics matrix nodes non-empty Note number of facets number of vertices polyhedral set poonem possible proof properties prove Radon's theorem rel int Schlegel diagram sequence simplicial polytopes Steinitz's theorem supporting hyperplane topological transformation transportation polytope triangular face undergraduate upper bound vector space vertex