Simple Explicit Formula for Counting Lattice Points of Polyhedra
From MaRDI portal
Abstract: Given and , we consider the problem of evaluating the counting function . We provide an explicit expression for as well as an algorithm with possibly numerous but very simple calculations. In addition, we exhibit finitely many fixed convex cones, explicitly and exclusively defined by , such that for any , the sum can be obtained by a simple formula involving the evaluation of over the integral points of those cones only. At last, we also provide an alternative (and different) formula from a decomposition of the generating function into simpler rational fractions, easy to invert.
Recommendations
Cited in
(5)- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Computing Optimized Path Integrals for Knapsack Feasibility
- On Counting Integral Points in a Convex Rational Polytope
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- A new and faster representation for counting integer points in parametric polyhedra
This page was built for publication: Simple Explicit Formula for Counting Lattice Points of Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429280)