Some improvements for the algorithm of Gröbner bases over dual valuation domain

Abstract

<abstract><p>As a special ring with zero divisors, the dual noetherian valuation domain has attracted much attention from scholars. This article aims at to improve the Buchberger's algorithm over the dual noetherian valuation domain. We present some criterions that can be applied in the algorithm for computing Gröbner bases, and the criterions may drastically reduce the number of S-polynomials in the course of the algorithm. In addition, we clearly demonstrate the improvement with an example.</p></abstract>