A Gr\"{o}ner basis for an ideal of a polynomial ring is a set of polynomials that allows us to algorithmically compute invariants and properties of the ideal. In this talk, we'll introduce the basics of Gr\"{o}bner theory, including Buchberger's algorithm. We'll then talk about computational and theoretical applications of Gr\"{o}bner bases. Speaker(s): Teresa Yu (University of Michigan, Ann Arbor)
Building: | East Hall |
---|---|
Event Type: | Workshop / Seminar |
Tags: | Mathematics |
Source: | Happening @ Michigan from Department of Mathematics |