Stephen Tawn (U Western Sydney)
Wednesday 6th June, 2012 16:00-17:00 204
In 1969 Garside gave a solution to the word and conjugacy problems for the braid group. The properties that he used have been generalised to give Garside monoids and Garside groups. This class of groups, which includes braid groups and spherical Artin groups, has very nice computational properties. In this talk I'll cover the basic definitions and proterties.