Enumerating projections of integer points in unbounded polyhedra
From MaRDI portal
Publication:4638995
Abstract: We extend the Barvinok-Woods algorithm for enumerating projections of integer points in polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the results to general formulas in Presburger Arithmetic. We also give an application to the k-Frobenius problem.
Recommendations
- Enumeration of integer points in projections of unbounded polyhedra
- Short rational generating functions for lattice point problems
- Enumerating integer points in polytopes with bounded subdeterminants
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
Cites work
- scientific article; zbMATH DE number 4204116 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- An application of simultaneous diophantine approximation in combinatorial optimization
- Bounded Algol-Like Languages
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Complexity of short Presburger arithmetic
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Computing the integer programming gap
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Effective lattice point counting in rational convex polytopes
- Fast integer programming in fixed dimension
- Integer Programming with a Fixed Number of Variables
- Integer points in polyhedra
- Lattice translates of a polytope and the Frobenius problem
- Local Euler-Maclaurin formula for polytopes
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- On Context-Free Languages
- Parametric integer programming in fixed dimension
- Parametric polyhedra with at least \(k\) lattice points: their semigroup structure and the \(k\)-Frobenius problem
- Point location in arrangements of hyperplanes
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Short rational generating functions for lattice point problems
- The taming of the semi-linear set
Cited in
(7)- Enumerating Collinear Points in Higher Dimensions
- Branching numbers for Euclidean projections onto convex polyhedra
- Enumeration of integer points in projections of unbounded polyhedra
- Enumerating a subset of the integer points inside a Minkowski sum
- Counting essential surfaces in \(3\)-manifolds
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Enumeration of Concrete Regular Covering Projections
This page was built for publication: Enumerating projections of integer points in unbounded polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638995)
