BSc Computer Science and Mathematics / Course details
Year of entry: 2020
Course unit details:
|Unit level||Level 3|
|Teaching period(s)||Semester 1|
|Offered by||Department of Mathematics|
|Available as a free choice unit?||No|
The central theme of this course is factorisation (theory and practice) in commutative rings; rings of polynomials are our main examples but there are others, such as rings of algebraic integers.
Polynomials are familiar objects which play a part in virtually every branch of mathematics. Historically, the study of solutions of polynomial equations (algebraic geometry and number theory) and the study of symmetries of polynomials (invariant theory) were a major source of inspiration for the vast expansion of algebra in the 19th and 20th centuries.
In this course the algebra of polynomials in n variables over a field of coefficients is the basic object of study. The course covers fairly recent advances which have important applications to computer algebra and computational algebraic geometry (Gröbner bases - an extension of the Euclidean division algorithm to polynomials in 2 or more variables), together with a selection of more classical material.
|Unit title||Unit code||Requirement type||Description|
|Algebraic Structures 2||MATH20212||Pre-Requisite||Compulsory|
|Algebraic Structures 1||MATH20201||Pre-Requisite||Compulsory|
(i) to take ideas such as Euclidean norms and factorisation in commutative rings, (ii) to provide a new set of tools and techniques that can be used to determine bases of ideals, (iii) to show how the commutative algebras interacts with geometry.
On successful completion of this course unit students will be able to demonstrate:
- define irreducible and prime elements of commutative rings and calculate the groups of units of some rings;
- define what is meant by an Euclidean domain and calculate Euclidean functions for some rings such as Gaussian integers;
- use Eisenstein's criterion to determine whether a given polynomial is irreducible;
- use Gauss' lemma to prove that polynomial rings in several variables are unique factorisation domains;
- state Hilbert's theorems on ideals of polynomial rings in several variables and use them to relate polynomials to algebraic varieties;
- define Gröbner bases of ideals in polynomial rings and use them to calculate generating sets of some ideals in polynomial rings in two or three variables.
1.Ideals in commutative rings: euclidean rings, principal ideal rings, noetherian rings. 
2.Ideals in polynomial rings: monomial orderings, Gröbner bases, Hilbert's basis theorem. 
3.Computing ideals in polynomial rings: division algorithm, Buchberger's algorithm. 
4.Factorisation: irreducible and prime elements, unique factorisation domains, Gauss's Lemma, Eisenstein's criterion, fields of fractions. 
5.Zero sets of polynomials: algebraically closed fields, affine varieties, radical of an ideal, elimination method, the Nullstellensatz. 
- Coursework: weighting 20%
- End of semester examination: two hours weighting 80%
Feedback tutorials will provide an opportunity for students' work to be discussed and provide feedback on their understanding. Coursework or in-class tests (where applicable) also provide an opportunity for students to receive feedback. Students can also get feedback on their understanding directly from the lecturer, for example during the lecturer's office hour.
D.A. Cox, J. Little and D. O'Shea, Ideals, Varieties and Algorithms (3rd edition), Springer 2007.
Reid, Miles. Undergraduate Commutative Algebra: London Mathematical Society Student Texts. Cambridge, UK: Cambridge University Press, April 26, 1996.
Atiyah, Michael, and Ian Macdonald. Introduction to Commutative Algebra. Reading, MA: Addison-Wesley, 1994.
Eisenbud, David. Commutative Algebra: With a View Toward Algebraic Geometry. New York, NY: Springer-Verlag, 1999.
|Scheduled activity hours|
|Independent study hours|
|Alexander Premet||Unit coordinator|