COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Polynomial-time proofs that groups are hyperbolic
Polynomial-time proofs that groups are hyperbolicAdd to your list(s) Download to your calendar using vCal
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 listsSensors & Actuators Seminar Series middle east studies Mobile Robots SeminarOther talksPtycho! Image processing diffraction patterns Commensal E. coli are a reservoir for the transfer of XDR plasmids into epidemic fluoroquinolone-resistant Shigella sonnei The homology of correspondence spaces and some massless tree amplitude identities The Enigmatic Premodern Book ULTRA-HIGH FIELD MRI SYSTEMS AND THEIR APPLICATION IN THE STUDY OF HUMAN BRAINS CANCELLED Film and News Media II (26-27 March 2020) |