Wintersemester 2002/2003

Vorlesungsankündigung

Franz Winkler

Vorlesungsankündigung

Franz Winkler

Tue 15.30-16.15 (Übungen), Place: T 711

first lecture: October 8

A theoretical introduction into the area of computer algebra is presented. Some of the main topics will be algorithms for basic algebraic domains (like integers, polynomials, finite fields, algebraic extension fields), computation by homomorphic images using the Chinese remainder algorithm, greatest common divisors of polynomials, factorization of univariate polynomials over finite fields, and the basic theory of Gröbner bases for polynomial ideals. The course will follow the appropriate chapters in

F. Winkler: *Polynomial Algorithms in Computer Algebra*,

Springer-Verlag Wien New York, 1996 (ISBN 3-211-82759-5)

Participants are expected to be acquainted with the basic notions in
algebra and algorithm theory.
In the exercise session (Übungen) the students will have to solve
both theoretical problems and practical problems with the help of
some computer algebra system.
Springer-Verlag Wien New York, 1996 (ISBN 3-211-82759-5)

first lecture: October 10

We discuss new results (by our group and also by others) in computer algebra, symbolic computation, computer aided geometric reasoning, and related topics. Participants give lectures in the seminar, and sometimes guest speakers are invited to present their work.

Place: Seminarraum Hagenberg

Invited guest speakers present their research work in symbolic computation.

We read and discuss recent publications in computer algebra.

Implementation of algorithms in computer algebra and constructive algebraic geometry.