A Variant of Gerdt's Algorithm for Computing Involutive Bases
Rings and Algebras
2011-08-17 v1 Symbolic Computation
Commutative Algebra
Abstract
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove correctness and termination of the modified algorithm and also correctness of the used criteria. The proposed algorithm has been implemented in Maple. We present experimental comparison, via some examples, of performance of the modified algorithm with its original form which has been implemented in Maple too. In doing so, we have taken care to provide uniform implementation details for the both algorithms.
Cite
@article{arxiv.1108.3261,
title = {A Variant of Gerdt's Algorithm for Computing Involutive Bases},
author = {Vladimir P. Gerdt and Amir Hashemi and Benyamin M. -Alizadeh},
journal= {arXiv preprint arXiv:1108.3261},
year = {2011}
}
Comments
13 pages