FI:M014 Geometric Algorithms II - Course Information
M014 Geometric Algorithms II
Faculty of InformaticsSpring 2001
- Extent and Intensity
- 2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- prof. RNDr. Jan Slovák, DrSc. (lecturer)
- Guaranteed by
- doc. RNDr. Jiří Kaďourek, CSc.
Departments – Faculty of Science
Contact Person: prof. RNDr. Jan Slovák, DrSc. - Prerequisites
- M008 Algebra I
Before enrolling this course the students must go through M008 Algebra I and should go through M013 Geometric Algorithms I. - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- Syllabus
- Basic course of Computational Algebraic Geometry, similar motivation as in the first part of the lectures, but for non-linear objects (given by systems of algebraic equations).
- Afine varieties and polynomial ideals (implicit and parametric description of varieties, the relation of ideals and varieties, examples).
- Gröbner bases (polynomial order, the division with remainder, Hilbert theorem, the existence of Gröbner bases).
- Buchberger's algorithm (reduced Gröbner bases, simple algorithm, Buchberger's algorithm, examples of applications).
- Elimination theory and decomposition of varieties (the elimination theorem, resultants, the extension theorem, implicitization of parametric description of varieties, indecomposable varieties).
- Applications to algebraic curves (solvability of systems of equations, singular points of curves, envelopes of families, tangents and tangent cones).
- Further applications (computerized proofs in plane geometry, Wu's method, kinematic problem for 'plane robots', the inverse problem, the singularities).
- Literature
- COX, David, John LITTLE and Donald O'SHEA. Ideals, Varieties, and Algorithms. 1st ed. New York: Springer-Verlag, 1992. UTM. info
- Language of instruction
- Czech
- Further Comments
- The course is taught once in two years.
The course is taught: every week. - Teacher's information
- http://www.math.muni.cz/~slovak/#1
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2001/M014