University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Polynomial-time proofs that groups are hyperbolic

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Polynomial-time proofs that groups are hyperbolic

Download to your calendar using vCal

  • UserColva Roney-Dougal (University of St Andrews)
  • ClockFriday 21 February 2020, 13:45-14:45
  • HouseCMS, MR13.

If you have a question about this talk, please contact .

A finitely-presented group G is hyperbolic if there is a linear 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, low-degree polynomial-time procedures which seek to prove that a given finitely-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.

This talk is part of the Geometric Group Theory (GGT) Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Department of Chemistry, Cambridge, Todd Hamied Room Virtual Tuesday 3rd June 4.00 - 5.30 p.m. in the New Faculty Building Room GS5.

Other talks

Group Work TBC Task performance predicts the substitution of feedforward by feedback drive in visual cortex Coming soon Cooperation for Nature Director's Welcome
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity