Polytopes of Maximal Volume Product - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete and Computational Geometry Année : 2019

Polytopes of Maximal Volume Product

Résumé

For a convex body K ⊂ R n , let K z = {y ∈ R n : y−z, x−z ≤ 1, for all x ∈ K} be the polar body of K with respect to the center of polarity z ∈ R n. The goal of this paper is to study the maximum of the volume product P(K) = min z∈int(K) |K||K z |, among convex polytopes K ⊂ R n with a number of vertices bounded by some fixed integer m ≥ n + 1. In particular, we prove that the supremum is reached at a simplicial polytope with exactly m vertices and we provide a new proof of a result of Meyer and Reisner showing that, in the plane, the regular polygon has maximal volume product among all polygons with at most m vertices. Finally, we treat the case of polytopes with n + 2 vertices in R n .
Fichier principal
Vignette du fichier
max-vol-prod-2017-08-arxiv.pdf (340.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01590248 , version 1 (19-09-2017)

Identifiants

  • HAL Id : hal-01590248 , version 1

Citer

Matthew Alexander, Matthieu Fradelizi, Artem Zvavitch. Polytopes of Maximal Volume Product. Discrete and Computational Geometry, 2019, 62, pp.583-600. ⟨hal-01590248⟩
90 Consultations
140 Téléchargements

Partager

Gmail Facebook X LinkedIn More