- The course will first cover much of the "classical" computational group theory, including the various algorithms for working with permutations, rewriting (which will also include Groebner Bases) and working with matrices over finite elds. This part will encompass about the first twelve lectures
- The second half of the course will cover the more recent work, including working with matrices of integers (to represent the group, or otherwise), the (very) current Matrix recognition project and Small Cancellation methods.
Bachelors: 80%
- Applicants must have a professional Bachelor's (4 years) awarded from a prestigious institution with a grade of 80%
7
9
- With 6.5 in Reading and 7.0 in other sections
