Isoperimetric problems for polytopes with a given number of vertices

From MaRDI portal





The authors address the following problem: among all convex \(d\)-polytopes \(P\) with \(n\) vertices and prescribed volume or minimal edge-length, for which is the intrinsic \(i\)-volume \(V_i(P)\) minimal? For fixed volume, the case of the simplex \((n=d+1)\) has been settled by \textit{H. Hadwiger} [`Vorlesungen über Inhalt, Oberfläche und Isoperimetrie'; Springer (1957; Zbl 0078.35703)]: the optima are regular. Here, the main concern is with the next case \(n=d+2\). Denote by \(T^m\) a regular \(m\)-simplex with edge-length 1. The polytope \(D(j; a,b)\) is then the convex hull of copies of \(aT^j\) and \(bT^{d-j}\), placed in orthogonal linear subspaces with their centroids at the origin. The main result is that the optimal \(d\)-polytopes with given volume and \(d+2\) vertices are \(D(j;a,b)\), for suitable \(j\), \(a\) and \(b\). For surface area in particular, they show that \(j=\lfloor d/2 \rfloor\), and \[ a^2:b^2= \lfloor d/2 \rfloor+1: \lceil d/2 \rceil+1. \] They also characterize the optimal polytope for smaller \(i\) in some special cases of small dimension. For minimal edge-length, there are fewer cases settled, all concerning mean width \((i=1)\); they include simplices, and again special cases in small dimensions.




Cited in
(28)








This page was built for publication: Isoperimetric problems for polytopes with a given number of vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339973)