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

A New Approach to the Word and Conjugacy Problems in the Braid Groups

โœ Scribed by Joan Birman; Ki Hyoung Ko; Sang Jin Lee

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
638 KB
Volume
139
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 solution to the conjugacy problem, but the improvements in its complexity are not clear at this writing.

๐Ÿ“œ 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 Probabilistic Approach to Conjugacy Cl
A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods, one obtains a probabilistic proof of Steinberg's count of unipotent matrices and generalizations of

A Probabilistic Approach Toward Conjugac
A Probabilistic Approach Toward Conjugacy Classes in the Finite General Linear and Unitary Groups
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

The conjugacy classes of the finite general linear and unitary groups are used to define probability measures on the set of all partitions of all natural numbers. Probabilistic algorithms for growing random partitions according to these measures are obtained. These algorithms are applied to prove gr

A new approach to the state-transfer pro
A new approach to the state-transfer problem
โœ S.D. Agashe; B.K. Lande ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB

A new and simple solution to the problem of determinin 9 a function which will effect a possible state transfer of a linear, time-invariant system is presented here. This solution is based on relatin9 the 9iven system to a family of phase-variable canonical form systems, i.e. to a family of scalar d