Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes

Details Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes

2009-03-30

arxiv.org/abs/0903.5223v2

Mathematics

Combinatorics

44 pages, results sharpened, new examples added

Scientific paper

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization problem, we construct a probability distribution on the set X such that a) the probability mass function is constant on the intersection of P and X and b) the expectation of the distribution lies in P. This allows us to apply Central Limit Theorem type arguments to deduce computationally efficient approximations for the number of integer points, volumes, and the number of 0-1 vectors in the polytope. As an application, we obtain asymptotic formulas for volumes of multi-index transportation polytopes and for the number of multi-way contingency tables.

Affiliated with

Also associated with

No associations

Rating

Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes 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 Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-425210