Date
Wed, 13 May 2015
Time
16:00 - 17:00
Location
C1
Speaker
Alexander Margolis
Organisation
Oxford

We say a group is accessible if the process of iteratively decomposing G as an amalgamated free product or HNN extension over a finite group terminates in a finite number of steps. We will see Dunwoody's proof that FP2 groups are accessible, but that finitely generated groups need not be. If time permits, we will examine generalizations by Bestvina-Feighn, Sela and Louder.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 14:57.