LMS/EPSRC Short Instructional Course

Computational Group Theory

St Andrews 2013


Image © The University of St Andrews

29th July - 2nd August 2013


Latest news

  • Friday afternoon - the course has ended. The organisers thank all the lecturers and participants for making it a highly successful event!
  • Richard Parker "the man behind the MeatAxe" will give the second Special Lecture!
  • Special Lectures announced:
    Konovalov (Tuesday) - Distributed Computations with GAP
    Parker (Thursday) - Algorithmic Generalisations of Small Cancellation Theory
  • Registration closed!

The Course

This LMS/EPSRC Short Instructional Course in Computational Group Theory is organised by the University of St Andrews and the London Mathematical Society. It will take place between Sunday 28th July (arrival day) and Friday 2nd August 2013 (departure day). The talks will happen from 29th July to 2nd August 2013 (inclusive). This course is run in the week immediately preceding Groups St Andrews 2013 in St Andrews.

Introduction

Ever since their invention in the last century, computers have been used to study groups. During the past few decades this subject area has matured into the research field of Computational Group Theory, which aims to develop, analyse and implement algorithms to work with groups on a computer. Researchers in many are as (Algebra, Combinatorics, Number Theory to name but a few) have to solve concrete problems for groups or want to test conjectures involving groups. Computational Group Theory has evolved as a standard tool for them, but successfully applying the available software often requires some knowledge of the algorithms to ask the right question. Thus knowledge of Computational Group Theory techniques is a useful tool for many graduate students, even if their research is not exactly in this area.

Objectives of the Course

This course will introduce students to the four main areas of Computational Group Theory: permutation groups, soluble and p-groups, matrix groups and finitely presented groups. We will cover typical problems and standard algorithms, along with the analysis of these algorithms and their practical use on a computer. In the practical sessions there will be some emphasis on using the computer algebra system GAP, a world wide open source project established in 1988. After this course the participants will have a good understanding of what computers can and cannot do with groups and will be able to use  to answer their own group theoretic questions. We aim to appeal to a broad spectrum of students from areas such as Algebra, Topology, Combinatorics and Graph Theory.

Principal Speakers:
Permutation Groups Alexander Hulpke (Colorado State University)
Soluble Groups and p-groups Bettina Eick (Technische Universität Braunschweig)
Matrix Groups/Constructive Recognition Derek Holt (University of Warwick)
Finitely Presented Groups Max Neunhöffer (University of St Andrews)

LMS/EPSRC Short Courses aim to provide training for postgraduate students in core areas of mathematics. Part of their success is the opportunity for students to meet other students working in related areas as well as the chance to meet a number of leading experts in the topic.