MATH 335 - Computational Algebra. |

Computational aspects of modern algebra. Computing in groups: algorithms, algorithmic problems in groups, finitely generated abelian groups, free groups and automata, finitely presented groups. Computing in rings: elementary notions of ring theory, ideals of polynomial rings in several variables, Groebner bases, elements of field theory.
Taught in alternate years Prerequisites: MATH 235 and MATH 236. Note: This course is intended primarily for students in the Major Program in Mathematics and the Joint Major Program in Mathematics and Computer Science. 3.000 Credit hours Schedule Types: Lecture, Final Exam Faculty of Science Mathematics and Statistics Department Restrictions: May not be enrolled in one of the following Levels: Doctorate Masters & Grad Dips & Certs May not be enrolled in one of the following Faculties: Faculty of Dentistry Faculty of Medicine School of Continuing Studies |

Return to Previous | New Search |