One of the most interesting questions about a group is whether 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 topologi
Fragments of the word δ in a Braid group
✍ Scribed by S. I. Adyan
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1984
- Tongue
- English
- Weight
- 382 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w| 2 g) for |w| log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w| 2 g 2 ). We also carry
A new presentation of the n-string braid group B n is studied. Using it, a new solution to the word problem in B n is obtained which retains most of the desirable features of the Garside Thurston solution, and at the same time makes possible certain computational improvements. We also give a related