1989
DOI: 10.1007/bf01443506
|View full text |Cite
|
Sign up to set email alerts
|

On a certain move generating link-homology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
168
0
1

Year Published

1992
1992
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 182 publications
(171 citation statements)
references
References 9 publications
2
168
0
1
Order By: Relevance
“…There are many prototypes for this in the recent literature. One example is the result of Murakami-Nakanishi [17], which is closely related to results of Matveev [15], which characterizes -equivalence classes of links in terms of their linking matrices. Another is the result of Habiro [13] classifying knots, all of whose finite-type invariants up to a certain degree are equal, via surgery along tree claspers.…”
Section: T S T T T Smentioning
confidence: 95%
“…There are many prototypes for this in the recent literature. One example is the result of Murakami-Nakanishi [17], which is closely related to results of Matveev [15], which characterizes -equivalence classes of links in terms of their linking matrices. Another is the result of Habiro [13] classifying knots, all of whose finite-type invariants up to a certain degree are equal, via surgery along tree claspers.…”
Section: T S T T T Smentioning
confidence: 95%
“…The self C 2 -equivalence coincides with the self -equivalence, which is an equivalence relation generated by self -moves. A -move is a local move as illustrated in Figure 1; see Murakami and Nakanishi [15]. The -move is called a self -move if all strands in Figure 1 belong to the same component of a (string) link; see Shibuya [19].…”
Section: Introductionmentioning
confidence: 99%
“…In other words, one can undo L by a sequence of double crossing changes shown below in Figure 3, where the loop g g p + g Figure 3: A double crossing change is nullhomotopic. These double crossing changes can be achieved by surgery on Y-graphs whose leaves are nullhomotopic, see [11,12] and also Lemma 4.7 below. So far, each of the Y-graphs have two leaves that bound a disk that intersects L at most once and a nullhomotopic leaf.…”
Section: Lemma 45 [3 Lemma 53] Let T Be a Trivial N-componentmentioning
confidence: 99%