University of Cambridge > Talks.cam > Differential Geometry and Topology Seminar > Polynomial-time Nielsen--Thurston type recognition

Polynomial-time Nielsen--Thurston type recognition

Add to your list(s) Download to your calendar using vCal

  • UserRichard Webb, Cambridge
  • ClockWednesday 02 November 2016, 16:00-17:00
  • HouseMR13.

If you have a question about this talk, please contact Ivan Smith.

A cornerstone of the study of mapping class groups is the Nielsen—Thurston classification theorem. I will outline a polynomial-time algorithm that determines the Nielsen—Thurston type and the canonical reducing curve system of a mapping class. Time permitting, I shall describe a polynomial-time algorithm to compute the quotient orbifold of a periodic mapping class, and I shall discuss the conjugacy problem for the mapping class group. This is joint work with Mark Bell.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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