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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Polynomial-time Nielsen--Thurston type recognition

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Centre for Mathematical Sciences, Cambridge MR11 (B1.39), CMS Pavilion B Feminist Classics Revisited

Other talks

On convective penetration of a buoyant plume into a stably stratified layer Title to be confirmed Machine Politics? Computers and AI in the History of Political Thought Title to be confirmed Morning Break A flexible Monte Carlo quantitative bias analysis for unmeasured confounding
 

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