Mathematics Graduate Students Organization

Seminar:

Date: February 4

Groebner bases are a general technique to represent and manipulate varieties in the polynomial ring in several variables on a computer. This technique can be thought as a generalization of the Gaussian elimination for solving linear systems of equations, and the Euclidean algorithm for finding the GCD. We will aim to solve the ideal membership problem.

Even when this talk is intended to be self-contained, we are assuming some familiarity with ideals in the polynomial ring in several variables.