A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra

D. Gribanov ; D. Malyshev

Sibirskie èlektronnye matematičeskie izvestiâ, Tome 19 (2022) no. 2, pp. 613-626

Résumé

Let a polytope $\mathcal{P}$ be defined by a system $A x \leq b$. We consider the problem to count a number of integer points inside $\mathcal{P}$, assuming that $\mathcal{P}$ is $\Delta$-modular. The polytope $\mathcal{P}$ is $\Delta$-modular if all the rank sub-determinants of $A$ are bounded by $\Delta$ in the absolute value. We present a new FPT-algorithm, parameterized by $\Delta$ and by the number of simple cones in the normal fun triangulation of $\mathcal{P}$, which is more efficient for $\Delta$-modular problems, than the approach of A. Barvinok et al. [1, 2, 3, 4, 5]. To this end, we do not directly compute the short rational generating function for $\mathcal{P} \cap \mathbb{Z}^n$, which is commonly used for the considered problem. We compute its particular representation in the form of exponential series that depends on one variable, using the dynamic programming principle. We completely do not use the A. Barvinok's unimodular sign decomposition technique. Using our new complexity bound, we consider different special cases that may be of independent interest. For example, we give FPT-algorithms for counting the integer points number in $\Delta$-modular simplicies and similar polytopes that have $n + O(1)$ facets. For any fixed $m$, we give an FPT-algorithm to count solutions of the unbounded $m$-dimensional $\Delta$-modular knapsack problem. For the case, when $\Delta$ grows slowly with respect to $n$, we give a counting algorithm, which is more effective, than the state of the art ILP feasibility algorithm due to [6, 7].

Détail

Keywords: integer linear programming, short rational generating function, bounded sub-determinants, multidimensional knapsack problem, subset-sum problem, counting problem.