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:Polynomial-time proofs that groups are hyperbolic
- Colva Roney-Dougal (University of St Andrews)
DTSTART;TZID=Europe/London:20200221T134500
DTEND;TZID=Europe/London:20200221T144500
UID:TALK136939AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/136939
DESCRIPTION:A finitely-presented group G is hyperbolic if ther
e is a linear bound on the number of relators requ
ired to prove that a word of length n is equal to
the identity in G. This talk will present some eff
icient\, low-degree polynomial-time procedures whi
ch seek to prove that a given finitely-presented g
roup is hyperbolic. For those presentations on whi
ch these procedures succeed\, we have further proc
edures which construct\, in low-degree polynomial
time\, a linear time word problem solver and a qua
dratic time conjugacy problem solver. The class of
finite presentations on which these procedures ar
e successful include all presentations satisfying
any of the standard small cancellation conditions\
, but also many others.
LOCATION:CMS\, MR13
CONTACT:
END:VEVENT
END:VCALENDAR