Seminars and Colloquia
Mathematics
Solving polynomial equations
Fri, Apr 06, 2018,
04:30 PM to 05:30 PM
at Madhava Hall
Prof. Manoj Kummini
Chennai Mathematical Institute
A Groebner basis for a set of polynomials is a special kind of a
generating set for the ideal it generates. Computing a Groebner basis is a
generalization of the euclidian division to compute GCDs of single-variable
polynomials and gaussian elimination to solve linear equations. We will
discuss an algorithm to compute Groebner bases (Buchberger algorithm) and
look at some applications in solving polynomial equations.
