Be comfortable drawing Cayley diagrams for all small groups. Here is my drawing for the quaternions (various students came up instead with 3D models). Glue opposite sides to form a torus, like playing "PacMan":
What makes this diagram tricky is that, unlike all others that we have seen, the faces don't tell the whole story. On a torus, there are closed loops that circle around the torus without bounding a face. (To be precise, there are two dimensions of such loops, and one computes this dimension in algebraic topology.) My diagram relies on these closed loops to identify vertices that would otherwise be distinct.
Wikipedia has a nice account (with proof) of Burnside's lemma. Be able to give this proof, and to apply Burnside's lemma to counting problems. (See last year's second midterm for some practice problems.)
Finish reading Chapter 5, with an emphasis on the later sections. Begin reading Chapter 6.
Chapter | Section | Page | Exercises |
5 | 5 | 192 | 1, 3, 4, 5, 12 |
5 | 6 | 193 | 1, 2, 3, 4, 5, 7 |
5 | 7 | 194 | 1, 2, 3, 4 |
5 | 8 | 194 | 1, 2, 3, 5, 7 |