Date
Wed, 28 Feb 2018
Time
16:00 - 17:00
Location
C5
Speaker
Giles Gardam
Organisation
Technion – Israel Institute of Technology


It is a classical theorem of Magnus that the word problem for one-relator groups is solvable; its precise complexity remains unknown. A geometric characterization of the complexity is given by the Dehn function. I will present joint work with Daniel Woodhouse showing that one-relator groups have a rich collection of Dehn functions, including the Brady--Bridson snowflake groups on which our work relies.

Last updated on 4 Apr 2022, 2:57pm. Please contact us with feedback and comments about this page.