2013
DOI: 10.2140/agt.2013.13.3099
|View full text |Cite
|
Sign up to set email alerts
|

A bound for orderings of Reidemeister moves

Abstract: 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.Comment: 11 pages, 15 figures; fixed minor typographical erro

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In this paper, we discuss such a simple sequence. There are some related papers in this topic (see [1], [2] [3], [4], [5], [7]).…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we discuss such a simple sequence. There are some related papers in this topic (see [1], [2] [3], [4], [5], [7]).…”
Section: Introductionmentioning
confidence: 99%