File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.startPage 108752 -
dc.citation.title TOPOLOGY AND ITS APPLICATIONS -
dc.citation.volume 341 -
dc.contributor.author Kwon, Bo-hyun -
dc.date.accessioned 2023-12-14T17:10:16Z -
dc.date.available 2023-12-14T17:10:16Z -
dc.date.created 2023-12-11 -
dc.date.issued 2024-01 -
dc.description.abstract An important issue in classifying rational 3-tangles is how to know whether or not a given tangle is the trivial rational 3-tangle called infinity-tangle. The author [4] provided a certain algorithm to detect the infinity-tangle. In this paper, we give a much simpler method to detect the infinity-tangle by using the bridge arc replacement. We hope that this method can help prove many application problems such as a classification of 3-bridge knots.(c) 2023 Elsevier B.V. All rights reserved. -
dc.identifier.bibliographicCitation TOPOLOGY AND ITS APPLICATIONS, v.341, pp.108752 -
dc.identifier.doi 10.1016/j.topol.2023.108752 -
dc.identifier.issn 0166-8641 -
dc.identifier.scopusid 2-s2.0-85174456746 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/66409 -
dc.identifier.wosid 001101406200001 -
dc.language 영어 -
dc.publisher ELSEVIER -
dc.title On detecting the trivial rational 3-tangle -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Mathematics, Applied; Mathematics -
dc.relation.journalResearchArea Mathematics -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Rational 3-tangle -
dc.subject.keywordAuthor Bridge disk -
dc.subject.keywordAuthor Bridge arc -
dc.subject.keywordAuthor Bridge arc replacement -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.