On Computing Janet Bases for Degree Compatible Orderings
Commutative Algebra
2007-05-23 v2 Rings and Algebras
Abstract
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 algorithm.
Keywords
Cite
@article{arxiv.math/0603161,
title = {On Computing Janet Bases for Degree Compatible Orderings},
author = {Vladimir P. Gerdt and Yuri A. Blinkov},
journal= {arXiv preprint arXiv:math/0603161},
year = {2007}
}
Comments
11 pages, Proceedings of the 10th Rhine Workshop on Computer Algebra (March 16-17, 2006, Basel, Switzerland), J.Draisma and H.Kraft (Eds.), University of Basel, 2006, pp.107--117