Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method
- 13 Downloads
Final polynomials and final syzygies provide an explicit representation of polynomial identities promised by Hilbert’s Nullstellensatz. Such representations have been studied independently by Bokowski [2,3,4] and Whiteley [23,24] to derive invariant algebraic proofs for statements in geometry.
In the present paper we relate these methods to some recent developments in computational algebraic geometry. As the main new result we give an algorithm based on B. Buchberger’s Gröbner bases method for computing final polynomials and final syzygies over the complex numbers. Degree upper bound for final polynomials are derived from theorems of Lazard and Brownawell, and a topological criterion is proved for the existence of final syzygies. The second part of this paper is expository and discusses applications of our algorithm to real projective geometry, invariant theory and matrix theory.
KeywordsInvariant Theory Symbolic Computation Zariski Closure Real Algebraic Geometry Fundamental Invariant
Unable to display preview. Download preview PDF.
- 4.J. Bokowski and B. Sturmfels, Computational Synthetic Geometry, Lecture Notes in Mathematics 1355, Springer, Heidelberg, 1989.Google Scholar
- 7.B. Buchberger, Gröbner bases — an algorithmic method in polynomial ideal theory, Chapter 6 in N.K. Bose (ed.): “Multidimensional Systems Theory”, D. Reidel Publ., 1985.Google Scholar
- 8.B. Buchberger, Applications of Gröbner bases in non-linear computational geometry, in J.R. Rice (ed.): Scientific Software, I.M.A. Volumes in Mathematics and its Applications, # 14, Springer, New York, 1988.Google Scholar
- 9.M.A. Dickrnann, Applications of model theory to real algebraic geometry, in “Methods in Mathematical Logic”, Lecture Notes in Mathematics 1130, Springer, Heidelberg, 1983, pp. 77–150.Google Scholar
- 17.T. McMillan and N. White, Cayley Factorization, in P. Gianni (ed.): Proc. ACM Intern. Symp. Symbolic and Algebraic Computation, Rome, July 1988, to appear.Google Scholar
- 18.D. Mumford, The Red Book on Varieties and Schemes, Lecture Notes in Mathematics 1358, Springer, Heidelberg, 1988.Google Scholar
- 20.B. Sturmfels and N. White, Gröbner bases and invariant theory, Advances in Math., to appear.Google Scholar
- 23.W. Whiteley, Logic and Invariant Theory, Ph.D. Dissertation, Massachussetts Institute of Technology, 1971.Google Scholar
- 24.W. Whiteley, Logic and invariant computation for analytic geometry, in “Symbolic Computations in Geometry”, I.M.A. Preprint # 389, University of Minnesota, January 1988.Google Scholar