Groebner Basis and its Applications
No Thumbnail Available
Date
2012-06
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
In this thesis we present the basic concepts and results of Groebner basis for a polynomial
ideal over a field and introduce an algorithm for computing and then present an
improvement of Buchberger's algorithms for computing Groebner basis by reducing
number of S-polynomials without computing them. This paper deals with Groebner
basis for a polynomial ideal over a ring by defining the module of a solution of a
homogenous linear equation with polynomial coeffcients (called the syzygy module).
And finally, we will see the application of Groebner basis in detail.
Description
Keywords
Groebner Basis and its Applications