Hello everyone,

Today Robert is finishing up his talks on polynomial pinching. 

Title: Polynomial pinching (Part 2) 

Speaker: Robert Haraway, Oklahoma State University 

Date: Jan 29, 2019 

Time: 3:30 PM 

Room: MSCS 509 

Abstract: In joint work with Neil Hoffman, we use the algorithm of Agol, Hass, and Thurston to give a construction of an ideal triangulation of the exterior of a normal surface S in a triangulation T that is polynomial in space and time of order |T| ∗ log |S|, where |T| is the number of tetrahedra and |S| is the total weight |S ∧ T|. (Part 2 of 2)