Return to Colloquia & Seminar listing
A bound for orderings of Reidemeister moves
Geometry/TopologySpeaker: | Julian Gold, UC Davis |
Location: | 2112 MSB |
Start time: | Tue, May 15 2012, 3:10PM |
We explore sequences of Reidemeister moves between links which are ordered: moves that raise the crossing number of successive diagrams are performed first in the sequence. In 2006, Alexander Coward showed that it's possible to build an ordered sequence from an unordered sequence. In this talk, we exhibit a bound for the number of moves in this ordered sequence.