Algorithmic solutions to decision problems in the braid groups땋임 군의 판별문제들에 대한 구현가능한 해

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 553
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKo, Ki-Hyoung-
dc.contributor.advisor고기형-
dc.contributor.authorLee, Sang-Jin-
dc.contributor.author이상진-
dc.date.accessioned2011-12-14T04:39:00Z-
dc.date.available2011-12-14T04:39:00Z-
dc.date.issued2000-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=157755&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/41820-
dc.description학위논문(박사) - 한국과학기술원 : 수학전공, 2000.2, [ [iii], [148] p. ]-
dc.description.abstractThe subject of this thesis is the algorithmic solution to various decision problems in the braid groups. In chapter 1, we introduce the notion of braids and important decision problems of the braid groups. In chapter 2, we introduce the band-generator presentation and study the semigroup of positive words in this presentation. Then we give an algorithmic solution to the word problem using this new presentation. Our algorithm is faster than the classical algorithm using Artin``s presentation. In chapter 3, we solve the conjugacy problem by an algorithm which is parallel to the prior works of Garside, Thurston and Elrifai-Morton. Moreover we improve the cycling theorem, which is one of two main theorems for the conjguacy problem, for both of Artin``s presentation and the band generator presentation. In chapter 4, it is proved that there is a polynomial time algorithm for the conjugacy problem of the 4-braid group, after analyzing the structure of the reduced super summit set. In chapter 5, we solve the shortest word problem in the 4-braid group and show that the closure of a positive 4-braid bounds a Bennequin surface. And we give an example which shows that the Bennequin theorem cannot be generalized to all of the 4-braids. In chapter 6, we classify all conjugacy classes of 3-braids that are related by flype operations. Among them we determine which conjugacy classes have representatives that admit both (+) and (-) flypes as an effort to search for a potential example of a pair of transversal knots that are topologically isotopic and have the same Bennequin number but are not transversally isotopic.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectBraid group-
dc.subjectConjugacy problem-
dc.subject순환변환-
dc.subject최소단어문제-
dc.subject단어문제-
dc.subject공액문제-
dc.subject땋임군-
dc.subjectCycling-
dc.subjectWord problem-
dc.subjectShortest word problem-
dc.titleAlgorithmic solutions to decision problems in the braid groups-
dc.title.alternative땋임 군의 판별문제들에 대한 구현가능한 해-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN157755/325007-
dc.description.department한국과학기술원 : 수학전공, -
dc.identifier.uid000945289-
dc.contributor.localauthorKo, Ki-Hyoung-
dc.contributor.localauthor고기형-
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0