scientific article; zbMATH DE number 3870585

From MaRDI portal
Publication:3336682





[For the entire collection see Zbl 0538.00005.] In 1965 the author introduced a critical-pair/completion algorithm that starts from a finite set F of polynomials in \(K[x_ 1,...,x_ n]\) (K a field) and produces a set G of polynomials such that the ideals generated by F and G are identical, but G is in a certain standard form (G is a Gröbner-basis), for which a number of important decision and computability problems in polynomial ideal theory can be solved elegantly. In this paper,it is shown how the critical-pair/completion approach can be extended to a class of rings that satisfies certain axioms of effectiveness. It can be shown that \(R[x_ 1,...,x_ n]\) satisfies these axioms if R satisfies the axioms. \(Z[x_ 1,...,x_ n]\) is an important example of a ring satisfying the axioms and, hence, allowing the construction of Gröbner bases for ideals by the critical- pair/completion algorithm. As an application, the ideal membership problem and the canonical simplification problem modulo ideals in \(Z[x_ 1,...,x_ n]\) can be solved by this approach. Also, a solution of the uniform word problem for finitely generated commutative rings is obtained as a corollary. A tutorial introduction into the method of Gröbner bases and the critical-pair/completion algorithm is given by the author in Chapter 6 of: Recent Trends in Multidimensional Systems Theory (N. K. Bose ed.), D. Reidel Publishing Company (to appear 1985) (available also as Techn. Report CAMP 83-29.0, Math. Inst., Univ. Linz, Austria).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336682)