The parametric lattice-point counting problem is as follows: Given an integer matrix A ∈ Zm×n , compute an explicit formula parameterized by b ∈ R that determines the number of integer points in the polyhedron {x ∈R : Ax É b}. In the last decade, this counting problem has received considerable attention in the literature. Several variants of Barvinok’s… (More)

@inproceedings{Eisenbrand2013MinimizingTN,
title={Minimizing the number of lattice points in a translated polygon},
author={Friedrich Eisenbrand and Nicolai H{\"a}hnle},
booktitle={SODA},
year={2013}
}