A Variant of Gerdts Algorithm for Computing Involutive Bases

Cover Page

Cite item


In , the fist author presented an efficient algorithm for computing involutive (and reduced Gr̈obner) bases. In this paper, we consider a modification of the 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 described in and implemented in Maple too. In doing so, we have taken care to provide uniform implementation details for the both algorithms.

About the authors

V P Gerdt

Joint Institute for Nuclear Research

Email: gerdt@jinr.ru
; Joint Institute for Nuclear Research

Amir Hashemi

Isfahan University of Technology

Email: Amir.Hashemi@cc.iut.ac.ir
; Isfahan University of Technology

Benyamin M-Alizadeh

Isfahan University of Technology

Email: B.Alizadeh@math.iut.ac.ir
; Isfahan University of Technology


Copyright (c) 2012 Гердт В.П., Хашеми А., М-Ализадех Б.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies