Decomposition of polytopes and polynomials

Details Decomposition of polytopes and polynomials Decomposition of polytopes and polynomials

2000-12-12

arxiv.org/abs/math/0012099v1

Mathematics

Combinatorics

29 pages, to appear in Discrete and Computational Geometry

Scientific paper

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algorithm which is based upon projections and uses randomization. Applications of our algorithm include absolute irreducibility testing and factorization of polynomials via their Newton polytopes.

Affiliated with

Also associated with

No associations

Rating

Decomposition of polytopes and polynomials 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 Decomposition of polytopes and polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition of polytopes and polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652747