On integer points in polyhedra: A lower bound (Q1196682): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:29, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On integer points in polyhedra: A lower bound |
scientific article |
Statements
On integer points in polyhedra: A lower bound (English)
0 references
16 January 1993
0 references
For a polyhedron \(P\subset\mathbb{R}^ n\) let \(P_ I\) denote the convex hull of integer points in \(P\). It is known that \(P_ I\) can have at most \(O(\varphi^{n-1})\) vertices if \(P\) is a rational polyhedron with size \(\varphi\). Here the size of a rational polyhedron is the sum of the sizes of the defining inequalities, measured by the encoding lengths as binary strings. The authors give an example which shows that \(P_ I\) can have as many as \(\Omega(\varphi^{n-1})\) vertices.
0 references
lattices
0 references
polytopes
0 references
rational polytopes
0 references