A syllabus will be made available here in separate chapters.
Chapter 1 Representation theory basics
Exercises
The syllabus contains several exercises on different degrees of difficulty.
It is warmly recommended to work on these exercises.
Every week a compulsory set of exercises has to be handed in.
These exercises will be made available here after tuesday's lecture
and are due until the lecture of the following week.
They can be handed in at my office (N2024) or during the lecture.
Exercises 1 October 1, 2002
Exercises 2 October 8, 2002
Tutor hour
The tutor hour gives opportunity to pose questions on the material
presented in the lectures,
to fill in details left out during the course and to look at explicit examples.
Especially in the first few weeks the tutor hours may be useful to
balance different levels of pre-knowledge.
Computer practice
Since this course puts emphasis on the algorithmic aspects
of representation theory,
we will use the computer algebra package MAGMA to work on explicit examples.
An introduction to MAGMA will be given jointly with the
course Computational Number Theory by Wieb Bosma.