Efficiently computing Groebner bases of ideals of points

Details Efficiently computing Groebner bases of ideals of points Efficiently computing Groebner bases of ideals of points

2007-11-21

arxiv.org/abs/0711.3475v1

Mathematics

Commutative Algebra

12 pages, 2 figures

Scientific paper

We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies a set of essential variables, which reduces the time complexity with respect to the number of indeterminates, and then uses PLU decompositions to reduce the time complexity with respect to the number of points. This gives a theoretical upper bound for its time complexity that is an order of magnitude lower than the known one for the standard Buchberger-Moeller algorithm if the number of indeterminates is much larger than the number of points. Comparison of implementations of our algorithm and the standard Buchberger-Moeller algorithm in Macaulay 2 confirm the theoretically predicted speedup. This work is motivated by recent applications of Groebner bases to the problem of network reconstruction in molecular biology.

Affiliated with

Also associated with

No associations

Rating

Efficiently computing Groebner bases of ideals of points 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 Efficiently computing Groebner bases of ideals of points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently computing Groebner bases of ideals of points will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309993