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.
Wed, 28 Feb 2018
16:00 - 17:00
Technion – Israel Institute of Technology