Generalized Braid Groups and Rigidity
β Scribed by K. Strambach; H. Volklein
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 589 KB
- Volume
- 175
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, a configuration with n = (g) points in the plane is described. This configuration, as a matroid, is a Desargues configuration if d = 5, and the union of (~) such configurations if d > 5. As an oriented matroid, it is a rank 3 truncation of the directed complete graph on d vertices. Fr
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko, and Lee [Adv. Math. 139 (1998) 322-353]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups an
A new presentation for the 4-braid group (called the band-generator presentation) is introduced. The word problem, the conjugacy problem and the shortest word problem for this presentation are solved.