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 |
Part I | 45 |
Copyright | |
3 other sections not shown
Common terms and phrases
affine affine transformation amount applications assume bounded called clearly closed convex set College column combination combinatorial compact complete cone conjecture consider contains conv convex hull course d-polytope defined Definition denote determined dimension discussion edges equality equations equivalent example exists extreme points face facets fact finite flat formula function geometry give given graph Grünbaum halfspaces Helly's theorem Hence holds hyperplane implies independent induction interesting interior intersection K₁ K₂ Klee known least lectures linear mathematics matrix nodes Note number of vertices obtain origin particular plane polytopes positive possible problem projective proof properties prove question rational realization rel int segment separated sequence shown simple space subset supporting theorem transformation transportation University vector vertex vertices