A bound for orderings of Reidemeister moves

Details A bound for orderings of Reidemeister moves A bound for orderings of Reidemeister moves

2011-11-29

arxiv.org/abs/1111.7000v2

Mathematics

Geometric Topology

11 pages, 15 figures; fixed minor typographical error

Scientific paper

We provide an upper bound on the number of ordered Reidemeister moves
required to pass between two diagrams of the same link. This bound is in terms
of the number of unordered Reidemeister moves required.

Affiliated with

Also associated with

No associations

Rating

A bound for orderings of 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 A bound for orderings of Reidemeister moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bound for orderings of Reidemeister moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6536