1990
DOI: 10.1142/9789812798329_0023
|View full text |Cite
|
Sign up to set email alerts
|

The minimal number of Seifert circles equals the braid index of a link

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
63
0
1

Year Published

1994
1994
2018
2018

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(64 citation statements)
references
References 2 publications
0
63
0
1
Order By: Relevance
“…P r o o f of Theorem 2.1. The following proof is based on Yamada's proof of Alexander's theorem in [6], see also [3]. Let G be a disjoint union of a θ m -curve and an oriented link, and D be a diagram of G in R 2 whose vertices are placed on the top and bottom as Figure 4.…”
Section: Example 23mentioning
confidence: 99%
“…P r o o f of Theorem 2.1. The following proof is based on Yamada's proof of Alexander's theorem in [6], see also [3]. Let G be a disjoint union of a θ m -curve and an oriented link, and D be a diagram of G in R 2 whose vertices are placed on the top and bottom as Figure 4.…”
Section: Example 23mentioning
confidence: 99%
“…It follows from the result obtained by Yamada in [40] that the conjecture presented above is equivalent to the following one: Conjecture 5.1. For every diagram D of the link L that has the minimum number of Seifert cycles among all possible diagrams for L, the torsion w(D) of the diagram D is uniquely defined.…”
Section: Diagrams Links Seifert Graphs and Braid Indexmentioning
confidence: 84%
“…(3) A different weakening of Corollary 1-allowing D to be arbitrary, but concluding only ( * ′ [D])-follows easily by combining sBi and the (proof of the) main result of [20]. In fact, after posting the first version of the present article to the xxx Mathematics Archives, I received e-mail from Takuji Nakamura informing me that Nakamura's February 1998 master's thesis at Keio University (Japan) gives a proof of the Theorem using the techniques of [20]; and another reader has since kindly shown me how to use Vogel's algorithm [19] to give yet another proof.…”
Section: Introduction; Statement Of Resultsmentioning
confidence: 99%