BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Polynomial-time proofs that groups are hyperbolic - Colva Roney-Do
 ugal (University of St Andrews)
DTSTART:20200221T134500Z
DTEND:20200221T144500Z
UID:TALK136939@talks.cam.ac.uk
CONTACT:76015
DESCRIPTION:A finitely-presented group G is hyperbolic if there is a linea
 r bound on the number of relators required to prove that a word of length 
 n is equal to the identity in G. This talk will present some efficient\, l
 ow-degree polynomial-time procedures which seek to prove that a given fini
 tely-presented group is hyperbolic. For those presentations on which these
  procedures succeed\, we have further procedures which construct\, in low-
 degree polynomial time\, a linear time word problem solver and a quadratic
  time conjugacy problem solver. The class of finite presentations on which
  these procedures are successful include all presentations satisfying any 
 of the standard small cancellation conditions\, but also many others. 
LOCATION:CMS\, MR13
END:VEVENT
END:VCALENDAR