|Date: Tuesday, November 06, 2012
Location: 3096 East Hall (2:10 PM to 3:00 PM)
Title: What is ... a Grobner basis
Abstract: If you have a lot of linear equations, you should put them into row reduced form, using the Gauss-Jordan algorithm. If you have several polynomial equations in one variable, you should compute their GCD by the polynomial Euclidean algorithm. What should you do if you have many polynomial equations in many variables?
Often, the answer is "compute a Groebner basis". I'll tell you what a Groebner basis is, how your computer finds one and, if I have time, give some connections to commutative algebra.
Speaker: David Speyer