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 > Junior Geometry Seminar > Splitting detection in groups, and the connectivity of limit set complements
Splitting detection in groups, and the connectivity of limit set complementsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Macarena Arenas. The problem of finding algorithms to detect splittings of groups has received a lot of attention in recent years, the origins of which can be traced back to the algorithm of Jaco-Oertel for detecting whether a given 3-manifold is Haken. In this talk we will survey some results of this flavour, both old and new, before looking more closely at a related problem – deciding whether the limit set of a given quasiconvex subgroup of a one-ended hyperbolic group disconnects the boundary. This talk is part of the Junior Geometry Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMental Health Week 2013 Slavonic Studies Let cout inOther talksExperimental and numerical study of detonation reaction zones The development of cancer risk prediction models and their applications to prevention and early detection Antarctica:Isolated Continent Uncertainty quantification and data assimilation How Hilbert met Isabelle: Proof Between Generations |