Skip to main content
tags edited, question clarified, title editted
Source Link
Daniel Moskovich
  • 22.1k
  • 15
  • 139
  • 216

How do I efficiently find a sequence of Reidemeister Movesmoves between equivalent link diagrams?

In knot theory, two linkslink diagrams are equivalent if and only if they can be deformed from one to anotherrelated by performing a finite number of Reidemeister moves. But sometimes it is so confusing that I don't know which type move should I perform on link to get desired result. Is there anyan efficient procedure so that we can always get the desired resultto relate one link diagram to another provided we know that the two links are equivalent? What is the computational complexity of determining knot equivalence? Is it NP complete?

Also, isa related question: Is there any computer software which deals withefficiently finds Reidemeister moves between equivalent diagrams? Because sometimes I find it is very difficult to visualise the link after some Reidemeister moves.

Reidemeister Moves

In knot theory, two links are equivalent if and only if they can be deformed from one to another by performing a finite number of Reidemeister moves. But sometimes it is so confusing that I don't know which type move should I perform on link to get desired result. Is there any procedure so that we can always get the desired result provided we know that the two links are equivalent?

Also, is there any computer software which deals with Reidemeister moves? Because sometimes I find it is very difficult to visualise the link after some Reidemeister moves.

How do I efficiently find a sequence of Reidemeister moves between equivalent link diagrams?

In knot theory, two link diagrams are equivalent if and only if they can be related by performing a finite number of Reidemeister moves. But sometimes it is so confusing that I don't know which type move should I perform on link to get desired result. Is there an efficient procedure to relate one link diagram to another provided we know that the two links are equivalent? What is the computational complexity of determining knot equivalence? Is it NP complete?

Also, a related question: Is there any computer software which efficiently finds Reidemeister moves between equivalent diagrams? Because sometimes I find it is very difficult to visualise the link after some Reidemeister moves.

Source Link
Idonknow
  • 623
  • 5
  • 14

Reidemeister Moves

In knot theory, two links are equivalent if and only if they can be deformed from one to another by performing a finite number of Reidemeister moves. But sometimes it is so confusing that I don't know which type move should I perform on link to get desired result. Is there any procedure so that we can always get the desired result provided we know that the two links are equivalent?

Also, is there any computer software which deals with Reidemeister moves? Because sometimes I find it is very difficult to visualise the link after some Reidemeister moves.