Seminar series
Date
Mon, 15 Mar 2021
Time
15:45 -
16:45
Location
Virtual
Speaker
Marc Lackenby
Organisation
University of Oxford
I will outline a new algorithm for unknot recognition that runs in quasi-polynomial time. The input is a diagram of a knot with n crossings, and the running time is n^{O(log n)}. The algorithm uses hierarchies, normal surfaces and Heegaard splittings.