Advertisement

Polytopes; Compact Convex Sets

  • Marcel Berger
  • Pierre Pansu
  • Jean-Pic Berry
  • Xavier Saint-Raymond
Part of the Problem Books in Mathematics book series (PBM)

Abstract

We’ll be working in a d-dimensional real affine space X, for d finite. A polytope is a convex compact set with non-empty interior, which can be realized as the intersection of a finite number of closed half-spaces of X (cf. 2.G). We shall assume there are no superfluous half-spaces in the intersection. For d = 2 we use the word polygon.

Keywords

Compact Convex Isoperimetric Inequality Differentiable Manifold Regular Polyhedron Regular Simplex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Marcel Berger 1984

Authors and Affiliations

  • Marcel Berger
    • 1
  • Pierre Pansu
    • 2
  • Jean-Pic Berry
    • 3
  • Xavier Saint-Raymond
    • 3
  1. 1.U.E.R. de Mathematique et InformatiqueUniversité Paris VIIParis, Cedex 05France
  2. 2.Centre National de la Recherche ScientifiqueParisFrance
  3. 3.P.U.K.GrenobleFrance

Personalised recommendations