CECM | CAG | Department of Mathematics | SFU | MITACS | IRMACS | PIMS

About me Research Publications Students Teaching Talks Links

Grobner Bases and Algebraic Geometry, Spring 2008


  • Varieties, ideals, and algorithms.
  • Monomial orderings and the division algorithm.
  • Dickson's lemma and the Hilbert basis theorem.
  • Groebner bases and Buchberger's algorithm.
  • Solving systems of polynomial equations using Groebner bases.
  • Implicitization.
  • Resultants.
  • Hilbert's Nullstellensatz and radical ideals.
  • Irreducible varieties and prime ideals.
  • The prime(ary) decomposition of ideals.
  • Quotient rings.
  • Proving theorems in geometry.


Ideals, Varieties and Algorithms by Cox, Little, O'Shea


We will use Maple extensively for calculations and programming in this course. The university has a site license. Maple is installed on the PCs and MACs in the assignment lab, the CECM lab, university open labs and the library. Maple is available from the microcomputer store for about $180.

p. (778) 782-4279 · f. (778) 782-4947 · Shrum Science K 10501 · Department of Mathematics · 8888 University Drive · Burnaby · BC · V5A 1S6 · Canada