As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In this paper we describe an efficient involutive algorithm for constructing Gröbner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Gröbner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be output without any extra computational costs. We also discuss some accounts of experimental superiority of the involutive algorithm over Buchberger's algorithm.
loading subjects...
