Finding geodesics in the curve complex
Geometry of mapping class groups and Out(Fn) October 25, 2016 - October 28, 2016
Location: SLMath: Eisenbud Auditorium
Mapping Class Group
Curve Complex
Tight geodesics
Algorithms
35Q92 - PDEs in connection with biology, chemistry and other natural sciences
00A35 - Methodology of mathematics {For mathematics education, see 97-XX}
01-11 - Research data for problems pertaining to history and biography
14630
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.
Bell.Notes
|
Download |
14630
H.264 Video |
14630.mp4
|
Download |
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.