University of Cambridge > Talks.cam > Differential Geometry and Topology Seminar > Homological filling functions and the word problem

  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

Homological filling functions and the word problem

Download to your calendar using vCal

  • UserRobert Kropholler (Warwick)
  • ClockWednesday 18 May 2022, 16:00-17:00
  • HouseMR13.

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

For finitely generated groups the word problem asks for the existence of an algorithm that takes in words in a finite generating set and decides if a word is trivial or not. For finitely presented groups this is equivalent to the Dehn function being sub-recursive. There is an analogue of the Dehn function for groups of type $FP_2$, this function measures the difficulty of filling loops in a certain space with surfaces. In joint work with Noel Brady and Ignat Soroko, we give computations of the homological filling functions for Ian Leary’s groups $G_L(S)$. We use this to show that there are uncountably many groups with homological filling function $n^4$. This gives groups that have sub-recursive homological filling function but unsolvable word problem.

This talk is part of the Differential Geometry and Topology Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Martin Centre Research Seminars: 51st Series Physical Chemistry Research Interest Group Webinar & LT2, Computer Laboratory, William Gates Building.

Other talks

Tea and Coffee Break Scattering Plenty: the people who made the modern countryside Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study Title to be confirmed Loke CTR Annual Meeting 2026 - Epigenetics of embryogenesis and placentation Online Causal Inference Seminar
 

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