๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Note on Words in Braid Monoids

โœ Scribed by Jean Michel

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
152 KB
Volume
215
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A New Algorithm for Solving the Word Pro
A New Algorithm for Solving the Word Problem in Braid Groups
โœ D. Garber; S. Kaplan; M. Teicher ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

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

A New Approach to the Word and Conjugacy
A New Approach to the Word and Conjugacy Problems in the Braid Groups
โœ Joan Birman; Ki Hyoung Ko; Sang Jin Lee ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 638 KB

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

On a subgroup contained in some words wi
On a subgroup contained in some words with a bounded length
โœ Yahya Ould Hamidoune ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

Hamidoune, Y.O., On a subgroup contained in some words with a bounded length, Discrete Mathematics 103 (1992) 171-176. Let G be a group and let A and B be two finite nonvoid subsets of G such that 1$ B. Using results of Kemperman, we show that either IA U B U ABl b IAl + IBI or there exists a nonnul