December 2, 2008

Speaker: Heather Coughlin

Title: Gröbner Bases and Monomial Ideals


Abstract:  Gröbner bases are the backbone of Computational Commutative Algebra. We shall give a brief introduction to these computational gems – beginning with term orderings, and generalized polynomial division. After we discuss what Gröbner bases are, we shall explore some types of questions they are used to answer. Finally, we shall discuss how the idea of Gröbner bases can be used in determining the normality of monomial ideals (my research area).

Disclaimer: The talk will be aimed at an audience comfortable with polynomial long division.

Knowledge of rings and ideals will not be assumed. This means, all are welcome.