A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates (Q799242)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3874103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates |
scientific article; zbMATH DE number 3874103 |
Statements
A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates (English)
0 references
1984
0 references
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.
0 references
number of vertices
0 references
convex polyhedron
0 references
0.8163014054298401
0 references
0.7826915979385376
0 references
0.7744189500808716
0 references
0.7720054984092712
0 references
