Efficiently Computing Minimal Sets of Critical Pairs

Details Efficiently Computing Minimal Sets of Critical Pairs Efficiently Computing Minimal Sets of Critical Pairs

2003-10-09

arxiv.org/abs/math/0310130v1

Mathematics

Commutative Algebra

LaTeX using elsart.cls, 27 pages

Scientific paper

In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid _all_ non-minimal critical pairs, and hence to process only a_minimal_ set of generators of the module generated by the critical syzygies. In this paper we show how to obtain that desired solution in the homogeneous case while retaining the same efficiency as with the classical implementation. As a consequence, we get a new Optimized Buchberger Algorithm.

Affiliated with

Also associated with

No associations

Rating

Efficiently Computing Minimal Sets of Critical Pairs 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 Minimal Sets of Critical Pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently Computing Minimal Sets of Critical Pairs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-447347