University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Monster groups acting on CAT(0) spaces

  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

Monster groups acting on CAT(0) spaces

Download to your calendar using vCal

  • UserRémi Coulon (Université de Rennes 1; CNRS (Centre national de la recherche scientifique))
  • ClockThursday 16 February 2017, 10:00-12:00
  • HouseSeminar Room 2, Newton Institute.

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

NPC - Non-positive curvature group actions and cohomology

Since the beginning of the 20th century, infinite torsion groups have been the source of numerous developments in group theory: Burnside groups Tarski monsters, Grigorchuck groups, etc. From a geometric point of view, one would like to understand on which metric spaces such groups may act in a non degenerated way (e.g. without a global fixed point).   In this talk we will focus on CAT spaces and present two examples with rather curious properties. The first one is a non-amenable finitely generated torsion group acting properly on a CAT cube complex. The second one is a non-abelian finitely generated Tarski-like monster : every finitely generated subgroup is either finite or has finite index. In addition this group is residually finite and does not have Kazdhan property (T).   (Joint work with Vincent Guirardel)



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

Average on weekdays: 9201.77997738 kWh Clifford Allbutt Anglia Ruskin University, East Road, room Hel 251

Other talks

Title to be confirmed Title to be confirmed Title to be confirmed Afternoon Break Morning Tea and Coffee Title to be confirmed
 

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