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.
- Junior Topology and Group Theory Seminar