# On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices

Let A ∈ Z^m × n, rank(A) = n, b ∈ Z^m, and P be an n-dimensional polyhedron, induced by the system A x ≤ b. It is a known fact that if F is a k-face of P, then there exist at least n-k linearly independent inequalities of the system A x ≤ b that become equalities on F. In other words, there exists a set of indices J, such that |J| = n-k, rank(A_JC) = n-k, and A_J x - b_J = 0, for any x ∈ F. We show that a similar fact holds for the integer polyhedron P_I = conv(P ∩ Z^n) if we additionally suppose that P is Δ-modular, for some Δ∈{1,2,…}. More precisely, if F is a k-face of P_I, then there exists a set of indices J, such that |J| = n-k, rank(A_J) = n-k, and A_J x - b_J_∞ < Δ, for any x ∈ F ∩ Z^n. In other words, there exist at least n-k linearly independent inequalities of the system A x ≤ b that almost become equalities on F ∩ Z^n. When we say almost, we mean that the slacks are at most Δ-1 in the absolute value. Using this fact, we prove the inequality |vert(P_I)| ≤ 2 ·mn·Δ^n-1, for the number of vertices of P_I, which is better, than the state of the art bound for Δ = O(n^2).

• 12 publications
• 6 publications
• 2 publications
research
03/02/2023

### Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices

Consider a class of simplices defined by systems A x ≤ b of linear inequ...
research
10/04/2021

### Faster algorithm for counting of the integer points number in Δ-modular polyhedra

Let a polytope 𝒫 be defined by one of the following ways: (i) 𝒫 = {x ∈...
research
02/04/2019

### L^p-norm inequality using q-moment and its applications

For a measurable function on a set which has a finite measure, an inequa...
research
08/03/2023

### Inequalities Connecting the Annihilation and Independence Numbers

Given a graph G, the number of its vertices is represented by n(G), whil...
research
05/04/2021

### Counting vertices of integer polytopes defined by facets

We present a number of complexity results concerning the problem of coun...
research
06/04/2020

### An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

We present an integer programming model to compute the strong rainbow co...
research
02/03/2020

### Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ· polylog(Δ))-algorithm for knapsack, proximity and sparsity

In this work we consider properties of square and "close"-square Δ-modul...