Seminar series
Date
Wed, 01 May 2013
Time
16:00 -
17:00
Location
SR2
Speaker
Robert Kropholler
Organisation
University of Oxford
To continue the day's questions of how complex groups can be I will
be looking about some decision problems. I will prove that certain
properties of finitely presented groups are undecidable. These
properties are called Markov properties and include many nice properties
one may want a group to have. I will also hopefully go into an
algorithm of Whitehead on deciding if a set of n words generates F_n.