7.5 credits cr.
- Gå till denna sida på svenska webben
The course deals with computer algebraic aspects of polynomial rings by means of the theory of Gröbner bases.
The following topics and results are covered: ideals, Hilbert's basis theorem, affine varieties, Hilbert's nullstellensatz, monomial orderings, Gröbner bases, Buchberger's algorithm, elimination, quotient rings.
The course also includes an introduction to a modern computer algebra system (CAS) with focus on how to use it to solve applied problems from graph theory, theoretical computer science, and optimization.
The course consists of three elements: theory, practical exercises and project.
Instruction consists of lectures, practical exercises and projects.
The course is assessed through written examination, hand-in assignments and project work.
A list of examiners can be found on
ScheduleThe schedule will be available no later than one month before the start of the course. We do not recommend print-outs as changes can occur. At the start of the course, your department will advise where you can find your schedule during the course.
Note that the course literature can be changed up to two months before the start of the course.
Cox, Little, O'Shea; Ideal, varieties, and algorithms. Springer.