**
**

Polynomial Rings

**
University of Western Ontario
Computer Science Department
**

**Date:** September 11, 2009

*
*

*
*

*
*

**It is a standard problem in mathematical sciences to study which properties of a given structure are preserved in derived
structures. A trivial example of such preservation is the fact that every subgraph of a planar graph is itself planar. A more involved
example is the fact that, if is a unique factorization domain, then so is the ring of univariate polynomials over .
Many algorithms rely on properties that are preserved under certain transformations. For instance, if is again a unique
factorization domain, then the so-called subresultant algorithm reduces polynomial gcd computations in to number gcd
computations in .
In this course, we will discuss the algorithmic properties of that can be lifted to , with an emphasis on those which help
solving systems of equations. In particular, we will discuss the lifting from to of prime and primary decomposition of ideals.
**

**Here's a tentative schedule for the lectures.
**

- Commutative Rings (January, 11)
- Univariate polynomials (January, 18)
- Polynomial GCDs over direct products of fields (January, 25)
- Resultants (February, 1)
- Prime and primary decompositions (February, 8 and 15)
- Zero-dimensional ideals (March, 1 and 8)
- Regular chains (March, 15 and 22)
- Gröbner bases over rings (March, 29 and April, 5)
- Student presentations (TBA)

**Then six last lectures cover non-classical subjects that were developed in the
last decades by computer algebraists.
The theory of regular chains, introduced by M. Kalkbrener in 1991, will be
the central notion of this second series.
It is recognized today that regular chains are among the most efficient tools
for exact solving of systems of algebraic or differential equations.
**

**Outlines.**- To be posted.
**Lectures.**- To be posted.
**Projects.**- To be posted.
**Resources.**- These are links to some books and software related to the course.

*
*

moreno 2009-09-11