We discuss basic permutation group theory,
including the O'Nan-Scott theorem and
multiply transitive groups; applications for Cayley graphs and s-arc
transitive graphs;
and algorithms for computing with permutation groups.
Slides, part 1.
Slides, part 2.
Slides, part 3.