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
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Q219786 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jerzy Niewiarowski / rank | |||
Revision as of 07:47, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
