15:30
Algorithms for Seifert fibered spaces
Abstract
Given two mathematical objects, the most basic question is whether they are the same. We will discuss this question for triangulations of three-manifolds. In practice there is fast software to answer this question and theoretically the problem is known to be decidable. However, our understanding is limited and known theoretical algorithms could have extremely long run-times. I will describe a programme to show that the 3-manifold homeomorphism problem is in the complexity class NP, and discuss the important sub-case of Seifert fibered spaces.