Enumerating projections of integer points in unbounded polyhedra
classification
🧮 math.CO
cs.CGcs.DMcs.LOmath.LO
keywords
integerprojectionsenumeratingextendpointspolyhedraunboundedalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.