A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates (Q799242): Difference between revisions

The aim of the paper is to estimate the number of vertices of an n- dimensional convex polyhedron with respect to its n-dimensional volume. The authors solve positively a hypothesis of Arnold by proving that the above mentioned number does not exceed \(c(n)V(M)^{(n-1/n+1)}\), where V(M) is the volume of the polyhedron M.