Algorithm reading off a braid word from Yamada-Vogel construction야마다-보젤 방법에 의한 브레이드 워드 변환 알고리즘
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Ko, Ki-Hyung | - |
| dc.contributor.advisor | 고기형 | - |
| dc.contributor.author | Choi, Doo-Ho | - |
| dc.contributor.author | 최두호 | - |
| dc.date.accessioned | 2011-12-14T05:00:13Z | - |
| dc.date.available | 2011-12-14T05:00:13Z | - |
| dc.date.issued | 1996 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=105899&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/42435 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수학과, 1996.2, [ 26 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 Yamada, Vogel, respectively. In this paper, we will introduce an algorithm reading off the braid words from a using Yamada-Vogel construction so that anything can be realized on a computer. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Yamada | - |
| dc.subject | Braid | - |
| dc.subject | Algorithm | - |
| dc.subject | Vogel | - |
| dc.subject | 보젤 | - |
| dc.subject | 야마다 | - |
| dc.subject | 브레이드 | - |
| dc.subject | 알고리즘 | - |
| dc.title | Algorithm reading off a braid word from Yamada-Vogel construction | - |
| dc.title.alternative | 야마다-보젤 방법에 의한 브레이드 워드 변환 알고리즘 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 105899/325007 | - |
| dc.description.department | 한국과학기술원 : 수학과, | - |
| dc.identifier.uid | 000943549 | - |
| dc.contributor.localauthor | Ko, Ki-Hyung | - |
| 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.