Algebra Seminar
Speaker: Johannes Middeke (Western University)
"49 years of Gr¨obner bases "
Time: 14:30
Room: MC 107
Ever since their first description in the 1965 PhD thesis of Bruno Buchberger, Gr¨obner bases have been an important tool for computational algebra. We can view Gr¨obner bases as a nonlinear
version of Gaussian Elimination or a multivariate version of
Euclid's Algorithm. They allow to answer problems in ideal theory,
polynomial system solving, algebraic geometry, homological algebra,
graph theory, diophantine equations and many other areas.
In this talk we will discuss the mathematical definition of Gr¨obner
bases of polynomial ideals, computation of Gr¨obner bases with
Buchberger's algorithm, conversion of Gr¨obner bases using the FGLM
algorithm and the Gr¨obner walk, generalisations of Gr¨obner bases
beyond commutative polynomials, and a selected number of
applications including ideal comparison as well as symbolic
summation.