论文信息 - Term Rewriting for the Conjugacy Problem and the Braid Groups

Term Rewriting for the Conjugacy Problem and the Braid Groups

We show how term rewriting can be applied to the conjugacy problem for finitely presented groups. The conjugacy problem is paricularly important for the braid groups. We illustrate the term rewriting approach by applying it to the braid group B3.

John Pedersen | Margaret Yoder

[1] Alain Jacquemard,et al. About the effective classification of conjugacy classes of braids , 1990 .

[2] Michael M. Richter,et al. Systems of Reductions , 1987, Lecture Notes in Computer Science.

[3] T. Evans. On multiplicative systems defined by generators and relations , 1951, Mathematical Proceedings of the Cambridge Philosophical Society.

[4] E. Artin. The theory of braids. , 1950, American scientist.

[5] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.

[6] J. Birman. Braids, Links, and Mapping Class Groups. , 1975 .

[7] Kenneth C. Millett,et al. A new polynomial invariant of knots and links , 1985 .

[8] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[9] Vaughan F. R. Jones,et al. Hecke algebra representations of braid groups and link polynomials , 1987 .

[10] Ronald V. Book. Thue Systems as Rewriting Systems , 1987, J. Symb. Comput..

[11] V. Turaev. The Yang-Baxter equation and invariants of links , 1988 .

[12] V. Jones. A polynomial invariant for knots via von Neumann algebras , 1985 .

[13] Philippe le Chenadec. Canonical forms in finitely presented algebras , 1984, Research notes in theoretical computer science.

[14] M. Dehn. Über unendliche diskontinuierliche Gruppen , 1911 .

[15] F. A. Garside,et al. THE BRAID GROUP AND OTHER GROUPS , 1969 .

[16] Hugh R. Morton,et al. ALGORITHMS FOR POSITIVE BRAIDS , 1994 .