Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
Hiroshi Hirai, Ryunosuke Oshiro, and Ken'ichiro Tanaka

TL;DR
This paper introduces a new algorithm for counting integer points in rational polytopes using numerical contour integration, improving space complexity and applying it to hypergraph b-matching problems.
Contribution
The paper develops a novel numerical analysis approach for counting integer points in polytopes, providing an efficient algorithm with improved space complexity and extending it to hypergraph b-matching.
Findings
Algorithm runs in polynomial time with respect to input size and polytope parameters.
Improves space complexity over naive dynamic programming methods.
Applies to hypergraph b-matching, generalizing classical results.
Abstract
In this paper, we address the problem of counting integer points in a rational polytope described by , where is an integer matrix and is an -dimensional integer vector. We study the Z-transformation approach initiated by Brion-Vergne, Beck, and Lasserre-Zeron from the numerical analysis point of view, and obtain a new algorithm on this problem: If is nonnegative, then the number of integer points in can be computed in time and space.This improves, in terms of space complexity, a naive DP algorithm with -size DP table. Our result is based on the standard error analysis to the numerical contour integration for the inverse Z-transform, and establish a new type of an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Combinatorial Mathematics · Machine Learning and Algorithms
