Description: |
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 of
Gröbner Bases, it allows for further research into areas of Computer
Science and Computational Algebra. Today, the Gröbner bases theory has
been very useful in providing computational tools to help solve a wide
array of problems in Mathematics, Science, Engineering and Computer
Science.
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 Insitute for Mathematics and its Applications, Minneapolis, and the Research Institute for Symbolic Computation, 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.
Visit Bernd Sturmfels' Official Website
|
Video Downloads
