BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Whitehead's algorithm for free groups and the free factor complex 
 - Dario Ascari (University of Oxford)
DTSTART:20220304T134500Z
DTEND:20220304T144500Z
UID:TALK168839@talks.cam.ac.uk
CONTACT:76015
DESCRIPTION:The classical Whitehead's algorithm allows\, given an element 
 of a free group\, to determine whether or not the element is part of some 
 basis for the free group. This has been proved\, generalized and applied i
 n several ways along the years\; we discuss some results\, both old and ne
 w.\n\nWe introduce the complex of free factors of a free group\; this is n
 aturally acted on by the group of automorphisms of the free group. This is
  the analogous for free groups of what the curve complex is for surfaces\;
  but despite the curve complex is quite well understood\, the free factor 
 complex remains more mysterious.
LOCATION:Zoom
END:VEVENT
END:VCALENDAR