Explicit Formula for Counting Lattice Points of Polyhedra

Details Explicit Formula for Counting Lattice Points of Polyhedra Explicit Formula for Counting Lattice Points of Polyhedra

2007-02-14

arxiv.org/abs/math/0702406v1

Mathematics

Algebraic Geometry

17 pages

Scientific paper

Given $z\in C^n$ and $A\in Z^{m\times n}$, we consider the problem of evaluating the counting function $h(y;z):=\sum\{z^x : x\in Z^n; Ax=y, x\geq 0\}$. We provide an explicit expression for $h(y;z)$ as well as an algorithm with possibly numerous but very simple calculations. In addition, we exhibit finitely many fixed convex cones, explicitly and exclusively defined by $A$, such that for any $y\in Z^m$, the sum $h(y;z)$ can be obtained by a simple formula involving the evaluation of $\sum z^x$ over the integral points of those cones only. At last, we also provide an alternative (and different) formula from a decomposition of the generating function into simpler rational fractions, easy to invert.

Affiliated with

Also associated with

No associations

Rating

Explicit Formula for Counting Lattice Points of Polyhedra 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 Explicit Formula for Counting Lattice Points of Polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit Formula for Counting Lattice Points of Polyhedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209929