Enumerating projections of integer points in unbounded polyhedra
Combinatorics
2018-03-06 v5 Computational Geometry
Discrete Mathematics
Logic in Computer Science
Logic
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.
Cite
@article{arxiv.1612.08030,
title = {Enumerating projections of integer points in unbounded polyhedra},
author = {Danny Nguyen and Igor Pak},
journal= {arXiv preprint arXiv:1612.08030},
year = {2018}
}