Minimum polyhedron with n vertices

DOI10.32917/H2018079MaRDI QIDQ2230000zbMATH OpenOpenAlexFDO

Authors Shigeki Akiyama

Publication date 17 September 2021

Published in Hiroshima Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.03149

zbMATH Keywords

Gröbner basisminimumpolyhedronrandom numerical searchsurface areavolume

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Isoperimetric problems for polytopes (52B60)

Abstract: We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not allow deformation of a single vertex. We also present possible minimum shapes for $nle12$, some of them are quite unexpected, in particular $n=8$.

Review text

The author investigates the problem of determining the polyhedra (\(3\)-polytopes) with a given volume and number \(n\) of vertices that minimize the surface area. Fejes Tóth claimed that the minimum \(n\)-hedron must have triangular faces, but his proof had a gap. However, following Fejes Tóth's ideas, the author gives a new proof of this fact, which was first established by \textit{K. Böröczky} and \textit{K. Böröczky jun.} [Mathematika 43, No. 2, 237--254 (1996; Zbl 0878.52006)]. The remainder of the paper is devoted to find minimum \(n\)-hedra for \(n \leq 12\). The technique employed uses random numerical searches with algebraic computation using Gröbner bases. Putative solutions are given, except for \(n = 8\) and \(11\), for which the author claims conjectural shapes may be beyond imagination; truly formidable polynomials of degrees \(12\) and \(13\) to be minimized occur in the analysis. (Of course, the theorem quoted shows that the cube is not a solution for \(n = 8\).)

Recommendations

• Nonflexible polyhedra with a small number of vertices
• Isoperimetric problems for polytopes with a given number of vertices
• scientific article; zbMATH DE number 5642599
• Polytopes of minimal volume with respect to a shell -- another characterization of the octahedron and the icosahedron
• On surface-minimizing polyhedral decompositions

Cites work

• Convex Polytopes
• scientific article; zbMATH DE number 3128853 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• scientific article; zbMATH DE number 3364397 (Why is no real title available?)
• scientific article; zbMATH DE number 3035524 (Why is no real title available?)
• scientific article; zbMATH DE number 3047155 (Why is no real title available?)
• Isoperimetric problems for polytopes with a given number of vertices
• On the convexity of piecewise-defined functions
• The Isepiphan Problem for n-Hedra
• The isoperimetric problem for 3-polytopes with six vertices

Cited in

(9)

• The roundest polyhedra with symmetry constraints
• Minimizing the mass of the codimension two skeleton of convex, unit volume polyhedra
• A unistable polyhedron with 14 faces
• Tetrahedron ABCD of Width 1 with Minimum AB + BC + CD
• Surface-area-minimizing n-hedral tiles
• Accelerated scattering of convex polyhedra
• scientific article; zbMATH DE number 5264904 (Why is no real title available?)
• scientific article; zbMATH DE number 5264906 (Why is no real title available?)
• A triangulated K3 surface with the minimum number of vertices

This page was built for publication: Minimum polyhedron with \(n\) vertices

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