BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Accessibility of partially acylindrical actions - Michael Hill (Un
 iversity of Cambridge)
DTSTART:20201030T134500Z
DTEND:20201030T144500Z
UID:TALK152824@talks.cam.ac.uk
CONTACT:76015
DESCRIPTION:A graph of groups is a common way of decomposing a group into 
 subgroups. Suppose we are given a group G. A natural question to ask is if
  there is some bound on the complexity on a graph of groups decomposition 
 for G. A basic example of a result in this direction is due to Dunwoody\, 
 who gives a bound for finitely presented groups on the number of edges giv
 en that every edge group is finite. Conversely there is no such bound for 
 a general finitely generated group\; again shown by Dunwoody. The purpose 
 of this talk is to show that a similar bound exists for groups which act a
 cylindrically on the corresponding Bass-Serre tree except on a class of su
 bgroups with "bounded height".
LOCATION:Zoom: https://maths-cam-ac-uk.zoom.us/j/91636583222
END:VEVENT
END:VCALENDAR