BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20221108T171500
DTEND;VALUE=DATE:20221108T171500
UID:12328@agenda.unifr.ch
DESCRIPTION:Thurston proved that a post-critically finite branched cover of the plane is either equivalent to a polynomial (that is: conjugate via a mapping class) or it has a topological obstruction. We use topological techniques – adapting tools used to study mapping class groups – to produce an algorithm that determines when a branched cover is equivalent to a polynomial, and if it is, determines which polynomial a topological branched cover is equivalent to. This is joint work with Jim Belk, Justin Lanier, and Dan Margalit.
SUMMARY:Polynomials, branched covers, and trees
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, auditoire 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/12328
END:VEVENT
END:VCALENDAR