An algorithm for constructing gröbner bases from characteristic sets and its application to geometry
- 67 Downloads
In Ritt's method, a prime ideal is given by a characteristic set. A characteristic set of a prime ideal is generally not a set of generators of this ideal. In this paper we present a simple algorithm for constructing Gröbner bases of a prime ideal from its characteristic set. We give a method for finding new theorems in geometry as an application of this algorithm.
Key wordsPolynomial, (Prime) ideal Generators (Irreducible) ascending chain (Irreducible) algebraic set Decomposition of an algebraic set Geometric configuration Nondegenerate component Geometry theorem proving
Unable to display preview. Download preview PDF.
- B. Buchberger, Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, Chapter 6 inRecent Trends in Multidimensional Systems Theory, N. K. Bose (ed.), Reidel, Dordrecht, 1985.Google Scholar
- S.-C. Chou and G.-J. Yang, On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving, Preprint, May, 1986, revised in July, 1987, to appear inAlgorithmica. Google Scholar
- P. Gianni, B. Trager, and G. Zacharias, Gröbner Bases and Primary Decomposition of Polynomial Ideals, Preprint, February, 1986.Google Scholar
- A. K. Rody, Effective Methods in the Theory of Polynomial Ideals, Ph.D. Thesis, Departments of Mathematical Sciences, Rensselaer Polytechnic Institute, 1984.Google Scholar