9 citations · 10 across the 3 of their papers we have counts for
3 papers
math.GT2011★ 1 cited
An upper bound on Reidemeister moves
Alexander Coward, Marc Lackenby
We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the e…
math.GT2009★ 9 cited
Ordering the Reidemeister moves of a classical knot
Alexander Coward
We show that any two diagrams of the same knot or link are connected by a sequence of Reidemeister moves which are sorted by type.
math.GT2008
Unknotting genus one knots
Alexander Coward, Marc Lackenby
For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the c…