Mathematics – Combinatorics
Scientific paper
2005-04-21
Mathematics
Combinatorics
21 pages
Scientific paper
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of a fixed dimension. The algorithm is based on the formula relating the kth coefficient of the Ehrhart quasi-polynomial of a rational polytope to volumes of sections of the polytope by affine lattice subspaces parallel to k-dimensional faces of the polytope. We discuss possible extensions and open questions.
No associations
LandOfFree
Computing the Ehrhart quasi-polynomial of a rational simplex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing the Ehrhart quasi-polynomial of a rational simplex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Ehrhart quasi-polynomial of a rational simplex will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-611944