The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases

Details The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases

2002-07-16

arxiv.org/abs/math/0207135v1

Advances in Applied Mathematics, 30:529--544, 2003

Mathematics

Combinatorics

Scientific paper

We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the state polyhedron of any member of the Hilbert scheme Hilb^d_n of n-long d-variate ideals, enabled by introducing the Hilbert zonotope H^d_n and showing that it simultaneously refines all state polyhedra of ideals on Hilb^d_n.

Affiliated with

Also associated with

No associations

Rating

The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases 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 The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561672