2010
DOI: 10.4171/qt/10
|View full text |Cite
|
Sign up to set email alerts
|

Minimal generating sets of Reidemeister moves

Abstract: Abstract.It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves 1, 2 and 3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of each of the 1 and 2 moves, and 8 versions of the 3 move. We introduce a minimal generating set of 4 oriented Reidemeister moves, which includes two 1 moves, one 2 move, and one 3 move. We then study which other sets of up to 5 oriented moves generate all mov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
106
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 127 publications
(107 citation statements)
references
References 12 publications
1
106
0
Order By: Relevance
“…As the canonical source-sink orientations are dependant on the orientation of the crossings we must show invariance under the oriented Reidemeister moves. In order to minimize the number of changes in cut loci in the diagrams outside of where the Reidemeister move occurs we chose to work with a set of oriented moves shown by Polyak [38], Theorem 1.2, to be minimal.…”
Section: Proof Of Invariancementioning
confidence: 99%
“…As the canonical source-sink orientations are dependant on the orientation of the crossings we must show invariance under the oriented Reidemeister moves. In order to minimize the number of changes in cut loci in the diagrams outside of where the Reidemeister move occurs we chose to work with a set of oriented moves shown by Polyak [38], Theorem 1.2, to be minimal.…”
Section: Proof Of Invariancementioning
confidence: 99%
“…In the same spirit as small "sets" of Reidemeister moves can generate all Reidemeister moves (as is shown in [18]), one naturally expects some 2-meridians to express as linear combinations of others. Since the equations derived from are by far the most numerous and the most complicated, we try to get rid of them in priority.…”
Section: Keeping Only One Tetrahedron Equationmentioning
confidence: 95%
“…The commutativity of the diagrams (10) and (11) means that (ϕ α , (ϕ α ) 2 , (ϕ α ) 0 ) is a monoidal endofunctor of C. The diagrams (12) and (13) indicate that the natural transformation ϕ 2 (α, β) is monoidal. The diagram (14) and the equality (ϕ 0 ) ½ = (ϕ 1 ) 0 indicate that the natural transformation ϕ 0 is monoidal.…”
Section: G-crossed Categoriesmentioning
confidence: 98%
“…Note that the type 3 moves determined by various orientations of the branches may be expanded as compositions of the type 3 move of Fig. 9 and the type 2 moves, see for instance [12]. Therefore, it is enough to consider only the type 3 move shown in Fig.…”
Section: Presentation Of Graphs By Diagramsmentioning
confidence: 98%