Fast Algorithms for Identification and Comparison of Braids |
| |
Authors: | A V Malyutin |
| |
Institution: | (1) St.Petersburg State University, Russia |
| |
Abstract: | A method for constructing algorithms solving the word and comparison problems for mapping class groups (in particular, for the braid group) is presented, and a family of one-side invariant orderings on the mapping class group of a surface with boundary is described. A method for constructing comparison algorithms for all finite orderings on the mapping class group of any surface with boundary is described, a fast and simple comparison algorithm for the Dehornoy order on the braid group is presented, examples of normal forms for braid groups are given, and algorithms for finding the forms are indicated. Bibliography: 15 titles. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|