메뉴 건너뛰기




Volumn 2, Issue , 1998, Pages 175-220

A new algorithm for recognizing the unknot

Author keywords

Algorithm; Braid; Foliation; Knot; Unknot

Indexed keywords


EID: 0000491887     PISSN: 14653060     EISSN: None     Source Type: Journal    
DOI: 10.2140/gt.1998.2.175     Document Type: Article
Times cited : (34)

References (15)
  • 1
    • 0002519851 scopus 로고
    • Entrelacements et equations de Pfa
    • D Bennequin, Entrelacements et equations de Pfa , Asterisque 107-108 (1983) 87-161
    • (1983) Asterisque , vol.107-108 , pp. 87-161
    • Bennequin, D.1
  • 2
    • 0003316111 scopus 로고
    • Braids, Links and mapping class groups
    • Princeton University Press
    • JS Birman, Braids, Links and mapping class groups, Annals of Math. Studies 82, Princeton University Press (1974)
    • (1974) Annals of Math. Studies 82
    • Birman, J.S.1
  • 4
    • 0001131295 scopus 로고    scopus 로고
    • A new approach to the word and conjugacy problems in the braid groups
    • to appear
    • JS Birman, KH Ko, SJ Lee, A new approach to the word and conjugacy problems in the braid groups, Advances in Mathematics, to appear
    • Advances in Mathematics
    • Birman, J.S.1    Ko, K.H.2    Lee, S.J.3
  • 5
    • 84966244807 scopus 로고
    • Studying links via closed braids V: Closed braid representatives of the unlink
    • JS Birman, W Menasco, Studying links via closed braids V: Closed braid representatives of the unlink, Trans AMS, 329 (1992) 585-606
    • (1992) Trans AMS , vol.329 , pp. 585-606
    • Birman, J.S.1    Menasco, W.2
  • 7
    • 0039349071 scopus 로고
    • The braid group and other groups
    • FA Garside, The braid group and other groups, Quart. J. Math. Oxford, 20 (1969) 235-254
    • (1969) Quart. J. Math. Oxford , vol.20 , pp. 235-254
    • Garside, F.A.1
  • 8
    • 51249193257 scopus 로고
    • Theorie der Normalflachen
    • W Haken, Theorie der Normalflachen, Acta math. 105 (1961) 245-375
    • (1961) Acta Math. , vol.105 , pp. 245-375
    • Haken, W.1
  • 13
    • 51249175518 scopus 로고
    • Representation of links by braids: A new algorithm
    • P Vogel, Representation of links by braids: A new algorithm, Comment. Math Helv. 65 (1990) 104-113
    • (1990) Comment. Math Helv. , vol.65 , pp. 104-113
    • Vogel, P.1
  • 15
    • 33646743875 scopus 로고
    • The minimal number of Seifert circles equals the braid index of a link
    • S Yamada, The minimal number of Seifert circles equals the braid index of a link, Invent. Math. 89 (1987) 347-356
    • (1987) Invent. Math. , vol.89 , pp. 347-356
    • Yamada, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.