On integer points in polyhedra: A lower bound Authors
Received: 21 April 1989 Revised: 12 March 1991 DOI:
Cite this article as: Bárány, I., Howe, R. & Lovász, L. Combinatorica (1992) 12: 135. doi:10.1007/BF01204716 Abstract
Given a polyhedron
P⊂ℝ we write P for the convex hull of the integral points in I P. It is known that P can have at most I 135-2 vertices if P is a rational polyhedron with size φ. Here we give an example showing that P can have as many as Ω(ϕ I vertices. The construction uses the Dirichlet unit theorem. n−1) AMS subject classification code (1991) 52 C 07 11 H 06
The results of the paper were obtained while this author was visiting the Cowles Foundation at Yale University
Download to read the full article text References
Z. I. Borevich, and I. R. Safarevich: Number theory, Academic Press, New York and London, 1966.
W. Cook, M. Hartmann, R. Kannan, and C. McDiarmid: On integer points in polyhedra, Combinatorica
12 (1992), 27–37.
A. C. Hayes, and D. G. Larman: The vertices of the knapsack polytope, Discrete Applied Math.
6 (1983), 135–138.
S. Lang: Algebraic number theory, Graduate Texts in Mathematics 110, Springer Verlag, New York etc., 1986.
D. Morgan: Personal communication, 1989.
D. S. Rubin: On the unlimited number of faces in integer hulls of linear programs with a single constraint, Operations Research
18 (1970), 940–946.
A. Schrijver: Theory of linear and integer programming, Wiley, Chichester, 1987.
V. N. Shevchenko: On the number of extreme points in integer programming, Kibernetika
2 (1981), 133–134.