Mathematics Logo

University of Wales, Bangor - School of Informatics



Mathematics H2 Modules 2000/2001

G3M07 COMBINATORIAL GROUP THEORY

Second semester

Lecturer: Prof T Porter

Recommended for further reading:

Aims:

Objectives
At the end of the course students should be able to:

Summary:
Groups occur naturally as symmetries of objects, e.g. the dihedral group D_3 is the symmetry group of the triangle. Often a group is specified in terms of various generating elements and relations between them, e.g. if R denotes a rotation through 120 degrees and S a flip over, then D_3 is generated by R and S and we know R^3=1, S^2=1 and (RS)^2=1. Does this information determine D_3 completely? Can one see the symmetry aspect of a group if we are given a presentation of it?
Given a presentation of G, how can one answer questions about G, such as
"What are the automorphisms of G?", "What subgroups does G have?".
The course examines group theory through presentations.

Prerequisites: G2M31.

Syllabus:

Review of Group Theory (from G2M31):
Definitions of: group homomorphism; order of an element; abelian group; kernel and image; commutator; quotient group. Statement and proof of the first Isomorphism Theorem and Lagrange's Theorem

Introduction of Standard Examples:
C_n, S_3, S_n, D_n; triangle groups D(l,m,n); groups of matrices, e.g. GL(2,3). Idea of a representation (both matrix and permutation). Cayley's Theorem.

Informal introduction to presentations:
Working with presentations: C_n, D_3, D_n, etc. (Elementary use of GAP on handout.) Conjugacy, normal subgroups, center, etc.

Van Dyck's Theorem and the Substitution Test:
Use to list endomorphisms, epimorphisms, and to pick out automorphisms in simple examples. Detailed analysis of C_n, D_3, and D_4. Exercises on D_n.

Free Groups and formal results on presentations:
Equivalent presentations, Tietze transformations and Tietze's Theorem. Examples of use.

The Todd-Coxeter Algorithm:
Simple examples by hand. Cayley graph and permutations representations from the output. (Harder examples using GAP.)

Cayley graph of a presentation:
Automorphisms of a graph; Frucht's Theorem.

Assessment:
2 hour end of semester closed book examination 100%

School of Informatics: home page
Mathematics home page.
U.W.Bangor Home Page.
Latest modification to this page: 30/ 5/00