Computing the period of an Ehrhart quasi-polynomial

Details Computing the period of an Ehrhart quasi-polynomial Computing the period of an Ehrhart quasi-polynomial

2004-11-09

arxiv.org/abs/math/0411207v1

Mathematics

Combinatorics

15 pages

Scientific paper

If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often, D(P) is the minimum period of i_P(t), but, in several interesting examples, the minimum period is smaller. We prove that, for fixed d, there is a polynomial time algorithm which, given a rational polytope P in R^d and an integer n, decides whether n is a period of i_P(t). In particular, there is a polynomial time algorithm to decide whether i_P(t) is a polynomial. We conjecture that, for fixed d, there is a polynomial time algorithm to compute the minimum period of i_P(t). The tools we use are rational generating functions.

Affiliated with

Also associated with

No associations

Rating

Computing the period of an Ehrhart quasi-polynomial 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 period of an Ehrhart quasi-polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the period of an Ehrhart quasi-polynomial will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367705