BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Geometric Group Theory (GGT) Seminar
SUMMARY:Accessibility of partially acylindrical actions -
Michael Hill (University of Cambridge)
DTSTART;TZID=Europe/London:20201030T134500
DTEND;TZID=Europe/London:20201030T144500
UID:TALK152824AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/152824
DESCRIPTION:A graph of groups is a common way of decomposing a
group into subgroups. Suppose we are given a grou
p G. A natural question to ask is if there is some
bound on the complexity on a graph of groups deco
mposition for G. A basic example of a result in th
is direction is due to Dunwoody\, who gives a boun
d for finitely presented groups on the number of e
dges given that every edge group is finite. Conver
sely there is no such bound for a general finitely
generated group\; again shown by Dunwoody. The pu
rpose of this talk is to show that a similar bound
exists for groups which act acylindrically on the
corresponding Bass-Serre tree except on a class o
f subgroups with "bounded height".
LOCATION:Zoom: https://maths-cam-ac-uk.zoom.us/j/9163658322
2
CONTACT:
END:VEVENT
END:VCALENDAR