Standard bases over Euclidean domains (Q2200296)

In [Ann. Math. (2) 79, 109--203 (1964; Zbl 0122.38603); Ann. Math. (2) 79, 205--326 (1964; Zbl 1420.14031)] \textit{H. Hironaka} investigated computational approaches towards singularities and introduced the notion of standard bases for local monomial orders. In [Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Innsbruck: Univ. Innsbruck, Mathematisches Institut (Diss.) (1965; Zbl 1245.13020)] \textit{B. Buchberger} initiated the theory of Gröbner bases for global monomial orders by which many fundamental problems in mathematics, science and engineering can be solved algorithmically. More precisely he introduced some key structural theory, and based on this theory, proposed the first algorithm for computing Gröbner bases. In this paper the authors explain techniques useful for the computation of strong Gröbner and standard bases over Euclidean domains. They introduce several new optimizations to the computation of strong standard bases over Euclidean domains, investigate several strategies for creating the pair set using an idea by Lichtblau and explain methods for avoiding coefficient growth using syzygies. Based on various examples they show that the new implementation in the computer algebra system Singularis, in general, more efficient than other known implementations