Finding geodesics in the curve complex
Location: MSRI: Simons Auditorium
Mapping Class Group
We will discuss a new algorithm for computing geodesics in the curve complex. This uses a refinement of the ideas of Masur-Minsky, Leasure, Shackleton, Watanabe and Webb to ensure such geodesics are found in polynomial time (in terms of their length). One corollary of this is a new (polynomial-time) algorithm to determine the Nielsen--Thurston type of a mapping class. This is joint work with Richard Webb.
Please report video problems to email@example.com.
See more of our Streaming videos on our main VMath Videos page.