Titre : A polynomial upper bound on Reidemeister moves.

Orateur : Marc Lackenby

Résumé : 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.