• Three 1-hour seminars; • One 2-hour applied class (in weeks 2-12) and • 7 hours of independent study per week.
Exhibit an in-depth understanding of different types of rings, such as integral domains, principal ideal domains, unique factorisation domains, Euclidean domains, fields, and skew-fields, amongst these are the Gaussian integers and quaternions, the most well-known skew-fields.
Generalise and apply known concepts over the integers to other domains, for example, use the Euclidean algorithm and factorisation algorithms in the algebra of polynomials.
Demonstrate understanding of the classification of finite fields.
Master the manipulation and application of the most common rings and fields: integers, integers modulo n, matrix rings, rationals, real and complex numbers, as well as more general structures such as number fields, algebraic extension fields, splitting fields, algebraic integers, and finite fields.
Construct larger fields from smaller fields (field extensions and splitting fields), demonstrating a deep understanding of these processes.
Apply a wide range of proof techniques to prove complex mathematical results.
Formulate and critically analyse abstract concepts in algebra.
Apply field theory to coding theory and demonstrate understanding of the classification of cyclic codes.
