Seminar series
Date
Mon, 26 Nov 2012
Time
15:45 -
16:45
Location
L3
Speaker
Marc Lackenby
Organisation
Oxford
Consider a diagram of the unknot with c crossings. There is a
sequence of Reidemeister
moves taking this to the trivial diagram. But how many moves are required?
In my talk, I will give
an overview of my recent proof that there is there is an upper bound on the
number of moves, which
is a polynomial function of c.