The series "New Horizons in Undergraduate Mathematics" showcases great lecturers speaking on topics from current research that are both important, accessible, and ready to enter the undergraduate curriculum.
This set of lectures on Gröbner bases (named after Wolfgang Gröbner) is designed as a first course for advanced undergraduate and graduate students. By understanding the theory and computational methods ofGröbner Bases, it allows for further research into areas of computer science and computational algebra. The Gröbner bases theory has been very useful in providing computational tools to help solve a wide array of problems in mathematics, engineering, and computer science.
- Introduction by David Eisenbud, Director of MSRI - Running Time of 4 minutes
- Lecture 1 - Running Time of 33 minutes
- Lecture 2 - Running Time of 48 minutes
- Q&A - Running Time of 12 minutes
- Supplemental Material
- Teacher's Guide
- Presentation Slides
- Lecture Notes
- Code Samples
To watch the lecture, please click here.
Interested in Gröbner Bases? Bernd Sturmfels' series of lectures Gröbner Bases and Convex Polytopes are also available to watch.
Bernd Sturmfels received doctoral degrees in Mathematics in 1987 from the University of Washington, Seattle, and the Technical University Darmstadt, Germany. After two postdoctoral years at the Institute for Mathematics and its Applications, Minneapolis, and the Research Institute for Symbolic Computation in Linz, Austria, he taught at Cornell University, before joining UC Berkeley in 1995, where he is Professor of Mathematics and Computer Science. His honors include a National Young Investigator Fellowship, a Sloan Fellowship, and a David and Lucile Packard Fellowship. Sturmfels served as von Neumann Professor at TU Munich in Summer 2002, as the Hewlett-Packard Research Professor at MSRI Berkeley in 2003/04, and he was a Clay Senior Scholar in 2004. A leading experimentalist among mathematicians, Sturmfels has authored or edited 13 books and about 140 research articles, in the areas of combinatorics, algebraic geometry, symbolic computation and their applications. He currently works on algebraic methods in statistics and computational biology.
This recording was produced through the VMath program at MSRI made possible by a grant from William R. Hearst.