On integer points in polyhedra: A lower bound

Imre Bárány, Roger Howe, László Lovász

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Given a polyhedron P⊂ℝ we write PI for the convex hull of the integral points in P. It is known that PI can have at most 135-2 vertices if P is a rational polyhedron with size φ. Here we give an example showing that PI can have as many as Ω(φ{symbol}n-1) vertices. The construction uses the Dirichlet unit theorem.

Original languageEnglish
Pages (from-to)135-142
Number of pages8
JournalCombinatorica
Volume12
Issue number2
DOIs
Publication statusPublished - Jun 1 1992

Keywords

  • AMS subject classification code (1991): 52C07, 11H06

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'On integer points in polyhedra: A lower bound'. Together they form a unique fingerprint.

  • Cite this