?
On a simple connection between Δ-modular ILP and LP, and a new bound on the number of integer vertices
In our note, we present a very simple and short proof of a new interesting fact about
the faces of an integer hull of a given rational polyhedron. This fact has a complete
analog in linear programming theory and can be useful to establish new constructive
upper bounds on the number of vertices in an integer hull of a delta-modular polyhedron,
which are competitive for small values of and can be useful for integer linear maximization
problems with a convex or quasiconvex objective function. As an additional
corollary, we show that the number of vertices in an integer hull is bounded by O(n)^n
for delta = O(1). As a part of our method, we introduce the notion of deep bases of a
linear program. The problem to estimate their number by a non-trivial way seems to
be quite challenging.