论文信息 - Lifting Canonical Algorithms from a Ring R to the Ring R[x]

Lifting Canonical Algorithms from a Ring R to the Ring R[x]

Given ample sets in a ring R we define related ample sets in the polynomial ring R[x]. For Noetherian rings we state natural and sufficient conditions for canonical form algorithms to be lifted to canonical form algorithms in R[x]. It is possible then to construct syzygies as well as to perform general division with respect to any finite set in R[x]. The construction is based on the notion of a Szekeres basis.

Ruth Shtokhamer

[1] Fred Richman,et al. Constructive aspects of Noetherian rings , 1974 .

[2] C. Ayoub. On constructing bases for ideals in polynomial rings over the integers , 1983 .

[3] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[4] Alfred Brauer. The Proof of the Law of Sines , 1952 .

[5] Rüdiger Loos,et al. Term Reduction Systems and Algebraic Algorithms , 1981, GWAI.

[6] George Szekeres,et al. A Canonical Basis for the Ideals of a Polynomial Domain , 1952 .

[7] D. McIlroy. Algebraic Simplification , 1966, CACM.

[8] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[9] Gyula Kőnig,et al. Einleitung in die allgemeine Theorie der algebraischen Gröszen , 1903 .

[10] Bruno Buchberger,et al. A critical-pair/completion algorithm for finitely generated ideals in rings , 1983, Logic and Machines.

[11] Franz Winkler. The Church-Rosser property in computer algebra and special theorem proving: an investigation of critical-pair/completion algorithms (Ph.D. thesis) , 1984, SIGS.