An upper bound on Reidemeister moves

Details An upper bound on Reidemeister moves An upper bound on Reidemeister moves

2011-04-11

arxiv.org/abs/1104.1882v2

Mathematics

Geometric Topology

40 pages, 14 figures; v2: very minor changes

Scientific paper

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 equivalence problem for links.

Affiliated with

Also associated with

No associations

Rating

An upper bound on Reidemeister moves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An upper bound on Reidemeister moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An upper bound on Reidemeister moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58322