Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices

by   D. Gribanov, et al.

Consider a class of simplices defined by systems A x ≤ b of linear inequalities with Δ-modular matrices. A matrix is called Δ-modular, if all its rank-order sub-determinants are bounded by Δ in an absolute value. In our work we call a simplex Δ-modular, if it can be defined by a system A x ≤ b with a Δ-modular matrix A. And we call a simplex empty, if it contains no points with integer coordinates. In literature, a simplex is called lattice-simplex, if all its vertices have integer coordinates. And a lattice-simplex called empty, if it contains no points with integer coordinates excluding its vertices. Recently, assuming that Δ is fixed, it was shown that the number of Δ-modular empty simplices modulo the unimodular equivalence relation is bounded by a polynomial on dimension. We show that the analogous fact holds for the class of Δ-modular empty lattice-simplices. As the main result, assuming again that the value of the parameter Δ is fixed, we show that all unimodular equivalence classes of simplices of the both types can be enumerated by a polynomial-time algorithm. As the secondary result, we show the existence of a polynomial-time algorithm for the problem to check the unimodular equivalence relation for a given pair of Δ-modular, not necessarily empty, simplices.


page 1

page 2

page 3

page 4


Notes on {a,b,c}-Modular Matrices

Let A ∈ℤ^m × n be an integral matrix and a, b, c ∈ℤ satisfy a ≥ b ≥ c ≥ ...

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 polyhed...

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...

Polyhedra Circuits and Their Applications

We introduce polyhedra circuits. Each polyhedra circuit characterizes a ...

The Distributive, Graded Lattice of EL Concept Descriptions and its Neighborhood Relation (Extended Version)

For the description logic EL, we consider the neighborhood relation whic...

Canonical form of modular hyperbolas with an application to integer factorization

For a composite n and an odd c with c not dividing n, the number of solu...

On lattice point counting in Δ-modular polyhedra

Let a polyhedron P be defined by one of the following ways: (i) P = {x...

Please sign up or login with your details

Forgot password? Click here to reset