University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Small cancellation theory over Burnside groups

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

Small cancellation theory over Burnside groups

Download to your calendar using vCal

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

NPCW01 - Non-positive curvature in action

Co-author: Rémi Coulon (Université de Rennes 1)
 
I will discuss how combinatorics and geometry work together to provide a new and easy-to-apply tool for constructing infinite bounded torsion groups with prescribed properties. The main tools are acylindrical actions of (classical or graphical) small cancellation groups on hyperbolic spaces and the theory of periodic quotients of groups admitting such actions. As applications, we obtain Gromov monsters with bounded torsion, we show the unsolvability of numerous decision problems in categories of bounded torsion groups, and we obtain a Rips construction for bounded torsion groups. This is joint work with Rémi Coulon.

Related Links

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lady Margaret Lectures Average on weekdays: 9017.86407767 kWh Zoom via link: https://eng-cam.zoom.us/j/81558947601?pwd=dUNxTE9TaG1LWGFUY3BKbTFZaWpBUT09, Meeting ID: 815 5894 7601 Passcode: 284574

Other talks

Cooperation as a Laboratory of Being Title to be confirmed Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Title abstract tbc Science & the Public in Action: Can and should climate scientists be activists? CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body
 

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