MAS 6396 Ideals, Varieties & Algorithms


Course Information

The course provides an introduction into computational techniques of elementary algebraic geometry. The main focus of the course is the close connection between ideals in polynomial rings on the algebraic side and varieties in affine space on the geometric side. The course emphasizes computational aspects and in particular provides an introduction to the theory of Gröbner bases in polynomial rings.

The course assumes familiarity with elementary concepts from algebra, as covered by the qualifying exam in algebra, for instance. Access to a computer algebra system will be provided and homework projects may require the use of a computer. Programming experience is not assumed, however.

The course will be based on the book Ideals, Varieties & Algorithms (David Cox, John Little, Donal O'Shea, Springer), which below is referred to as [CLO97]. I'll use the 2nd edition of the book, but any other edition will be fine, too, and you are not required to buy the book.

More information on the course is available in the syllabus. Your questions and comments are very welcome!

So far the following topics have been addressed in class:
Please do not hesitate to contact me anytime (see my homepage for email, phone number, etc.).
Apr 26, 2007