An algorithm for the word problem in braid groups
نویسنده
چکیده
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a σ1 consistent representative. We conjecture that the algorithm is quadratictime. We present numerical evidence for this conjecture, and prove two results: (1) The algorithm terminates in finite time. (2) The conjecture holds in the special case of 3-string braids in fact, we prove that the algorithm finds a minimal-lenght representative for any 3-string braid. AMS Classification 20F36; 20F60, 20F65
منابع مشابه
New presentations of surface braid groups
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
متن کاملGröbner-shirshov Basis for the Braid Group in the Birman-ko-lee-garside Generators
In this paper, we obtain Gröbner-Shirshov (non-commutative Gröbner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new “Garside word” δ ([2]). It gives a new algorithm for getting the Birman-KoLee Normal Form in the braid groups, and thus a new algorithm for solving the word problem in these groups.
متن کاملA New Algorithm for Solving the Word Problem in Braid Groups
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather than a geometrical one). The braid group is defined by the action of diffeomo...
متن کاملA Fast Algorithm to the Conjugacy Problem on Generic Braids
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside’s weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors incre...
متن کاملA Fast Algorithm to the Conjugacy Problem on Generic Braids Ki Hyoung Ko and Jang
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside’s weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors incre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008