Abstract
We present a completion-like procedure for constructing D-bases for polynomial ideals over commutative Noetherian rings with. unit. The procedure is described at an abstract level, by transition rules. Its termination is proved under certain assumptions about the strategy that controls the application of the transition rules. Correctness is established by proof simplification techniques.
The research described in this paper was supported in part by the National Science Foundation under grant CCR-9510072.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair. Canonical equational proofs. Birkhäuser, Boston, 1991.
L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. Theoretical Computer Science, 67:173–201, 1989.
L. Bachmair and H. Ganzinger. Buchberger's algorithm: a constraint-based completion procedure. In 1st Int. Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 285–301. Springer-Verlag, 1994.
L. Bachmair and D. Plaisted. Termination orderings for associative-commutative rewriting systems. J. Symbolic Computation, 1:329–349, 1985.
Leo Bachmair and Nachum Dershowitz. Equational inference, canonical proofs, and proof orderings. J. of the Association for Computing Machinery, 41:236–276, 1994.
T. Becker and V. Weispfenning. Gröbner bases: a computational approach to commutative algebra. Springer-Verlag, Berlin, 1993.
B. Buchberger. An algorithm for finding a basis for the residue class ring of a zero-dimensional ideal. PhD thesis, University of Innsbruck, Austria, 1965.
B. Buchberger. A critical-pair completion algorithm for finitely generated ideals in rings. In Proc. Logic and Machines: Decision Problems and Complexity, volume 171 of Lect. Notes in Comput. Sci., pages 137–161. Springer-Verlag, Berlin, 1983.
B. Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, pages 184–232. Reidel, 1985.
R. Bündgen. Buchberger's algorithm: The term rewriter's point of view. Theoretical Computer Science, 1996. To appear.
A. Kandri-Rody and D. Kapur. Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. J. Symbolic Computation, 6:37–57, 1988.
C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4:9–52, 1990.
K. Madlener and B. Reinert. Computing Gröbner bases in monoid and group rings. In Proc. ISSAC 93, pages 254–263. 1993.
L. Pan. On the D-bases of polynomial ideals over principal ideal domains. J. Symbolic Computation, 7:55–69, 1988.
G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. of the Association for Computing Machinery, 28:233–264, 1981.
F. Richman. Constructive aspects of Noetherian rings. Proc. of the American Mathematical Society, 44(2):436–441, 1974.
S. Stifter. A generalization of reduction rings. J. Symbolic Computation, 4:351–364, 1987.
W. Trinks. On B. Buchberger's method for solving algebraic equations. J. Number Theory, 10(4):475–488, 1978. (German).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmair, L., Tiwari, A. (1997). D-bases for polynomial ideals over commutative noetherian rings. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_65
Download citation
DOI: https://doi.org/10.1007/3-540-62950-5_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62950-4
Online ISBN: 978-3-540-69051-1
eBook Packages: Springer Book Archive