On Computing Janet Bases for Degree Compatible Orderings

Details On Computing Janet Bases for Degree Compatible Orderings On Computing Janet Bases for Degree Compatible Orderings

2006-03-07

arxiv.org/abs/math/0603161v2

Mathematics

Commutative Algebra

11 pages, Proceedings of the 10th Rhine Workshop on Computer Algebra (March 16-17, 2006, Basel, Switzerland), J.Draisma and H.

Scientific paper

We consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the standard data base of polynomial benchmarks for \Gr bases software we compare the modifications and confront them with Magma that implements Faug\`{e}re's $F_4$ algorithm.

Affiliated with

Also associated with

No associations

Rating

On Computing Janet Bases for Degree Compatible Orderings 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 On Computing Janet Bases for Degree Compatible Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computing Janet Bases for Degree Compatible Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366260