Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Hwa Jeong | - |
| dc.contributor.author | Takioka, Hideo | - |
| dc.date.available | 2017-07-05T08:39:18Z | - |
| dc.date.created | 2017-04-10 | - |
| dc.date.issued | 2016-06 | - |
| dc.identifier.issn | 0218-2165 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.11750/2269 | - |
| dc.description.abstract | In this paper, we construct an algorithm to produce canonical grid diagrams of cable links and Whitehead doubles, which give sharper upper bounds of the arc index of them. Moreover, we determine the arc index of 2-cable links and Whitehead doubles of all prime knots with up to eight crossings. © 2016 World Scientific Publishing Company. | - |
| dc.publisher | World Scientific Publishing Co. Pte Ltd | - |
| dc.title | On the arc index of cable links and Whitehead doubles | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1142/S0218216516500413 | - |
| dc.identifier.scopusid | 2-s2.0-84969940705 | - |
| dc.identifier.bibliographicCitation | Journal of Knot Theory and Its Ramifications, v.25, no.7 | - |
| dc.subject.keywordAuthor | Arc index | - |
| dc.subject.keywordAuthor | grid diagram | - |
| dc.subject.keywordAuthor | cable link | - |
| dc.subject.keywordAuthor | Whitehead double | - |
| dc.subject.keywordAuthor | Kauffman polynomial | - |
| dc.subject.keywordPlus | Arc Index | - |
| dc.subject.keywordPlus | Cable Link | - |
| dc.subject.keywordPlus | emBEDDING KNOTS | - |
| dc.subject.keywordPlus | Grid Diagram | - |
| dc.subject.keywordPlus | Kauffman Polynomial | - |
| dc.subject.keywordPlus | OPEN-BOOK | - |
| dc.subject.keywordPlus | Whitehead Double | - |
| dc.citation.number | 7 | - |
| dc.citation.title | Journal of Knot Theory and Its Ramifications | - |
| dc.citation.volume | 25 | - |
- Files in This Item:
-
There are no files associated with this item.
- Appears in Collections:
- ETC 1. Journal Articles
- School of Undergraduate Studies 1. Journal Articles
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.