Algorithm reading off a braid word from Morton threading모튼 실꿰기에 의한 브레이드 워드 변환 알고리즘
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Jin, Gyo-Taek | - |
| dc.contributor.advisor | 진교택 | - |
| dc.contributor.author | Lee, Sang-Yob | - |
| dc.contributor.author | 이상엽 | - |
| dc.date.accessioned | 2011-12-14T05:00:08Z | - |
| dc.date.available | 2011-12-14T05:00:08Z | - |
| dc.date.issued | 1996 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105894&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/42430 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수학과, 1996.2, [ 17 p. ] | - |
| dc.description.abstract | Alexander proved that any oriented link diagram can be transformed into a closed braid by an ambient isotopy. And this fact was proved by another method, by Morton. In this paper, for a given Morton threading, we will give an algorithm reading the braid words off from any link using Morton threading so that anything can be realized on a computer. For the convenience, we will proceed the arguments by taking an example. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Braid | - |
| dc.subject | Algorithm | - |
| dc.subject | Morton | - |
| dc.subject | 모튼 | - |
| dc.subject | 브레이드 | - |
| dc.subject | 알고리즘 | - |
| dc.title | Algorithm reading off a braid word from Morton threading | - |
| dc.title.alternative | 모튼 실꿰기에 의한 브레이드 워드 변환 알고리즘 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 105894/325007 | - |
| dc.description.department | 한국과학기술원 : 수학과, | - |
| dc.identifier.uid | 000943392 | - |
| dc.contributor.localauthor | Jin, Gyo-Taek | - |
| dc.contributor.localauthor | 진교택 | - |
- Appears in Collection
- MA-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.