English

Polytopes of Maximal Volume Product

Metric Geometry 2017-08-29 v1

Abstract

For a convex body KRnK \subset {\mathbb R}^n, let Kz={yRn:yz,xz1,\mbox forall xK}K^z = \{y\in{\mathbb R}^n : \langle y-z, x-z\rangle\le 1, \mbox{\ for all\ } x\in K\} be the polar body of KK with respect to the center of polarity zRnz \in {\mathbb R}^n. The goal of this paper is to study the maximum of the volume product P(K)=minzint(K)KKz\mathcal{P}(K)=\min_{z\in {\rm int}(K)}|K||K^z|, among convex polytopes KRnK\subset {\mathbb R}^n with a number of vertices bounded by some fixed integer mn+1m \ge n+1. In particular, we prove that the supremum is reached at a simplicial polytope with exactly mm 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 mm vertices. Finally, we treat the case of polytopes with n+2n+2 vertices in Rn{\mathbb R}^n.

Keywords

Cite

@article{arxiv.1708.07914,
  title  = {Polytopes of Maximal Volume Product},
  author = {Matthew Alexander and Matthieu Fradelizi and Artem Zvavitch},
  journal= {arXiv preprint arXiv:1708.07914},
  year   = {2017}
}
R2 v1 2026-06-22T21:24:04.965Z