论文信息 - Randomized Methods in Artin Groups of Finite Type - 字舞流文

Randomized Methods in Artin Groups of Finite Type

We investigate the use of random algorithms for the solution of the conjugacy problems for certain types of Artin groups of finite type including the braid groups.

Robert W. Bradshaw | Stephen P. Humphries

[1] Patrick Dehornoy,et al. Why are braids orderable , 2002 .

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

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

[4] Patrick Dehornoy,et al. Braids and self-distributivity , 2000 .

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

[6] J. Humphreys. Reflection groups and coxeter groups , 1990 .

[7] Luis Paris,et al. Centralizers of Parabolic Subgroups of Artin Groups of TypeAl,Bl, andDl , 1997 .

[8] Mina Teicher,et al. Identifying Half-Twists Using Randomized Algorithm Methods , 2002, J. Symb. Comput..