Gröbner bases are used to solve systems of polynomial equations, compute the images of algebraic varieties under projections or rational maps, and deduce properties of ideals such as dimension and number of zeros. They were introduced in 1965 by Bruno Buchberger and extended by many authors since then. Nikolai Günther had introduced a similar concept in 1913.

This course explores the relationship between algebra and computation, focusing on algorithms used for symbolic computation and modern algebra concepts. Subjects covered include proving combinatorial identities, Gröbner bases, symbolic integration, and experimental mathematics. Prerequisites suggest this is a mid-level course.