On Gröbner Bases and Their Uses in Solving System of Polynomial Equations and Graph Coloring

This paper is based on the analytic and computational solution procedures of Grobner basis and its applications. We show the behavior of the ideals generated by polynomials from a polynomial ring. We also present the idea of a zero dimensional ideal and use of this ideal to solve system of polynomial equations. We then introduce an algorithmic procedure for solving a system of polynomial equations (linear and nonlinear) with a finite number of solutions extending the idea of Grobner basis. Finally we explore the idea of Grobner basis for coloring the vertices of a given graph. We illustrate the stated results through a number of examples. Moreover, as for auxilary and making comparison with the analytic results, we use Mathematica 9.0.1 to develop some computer algebra.