论文信息 - EXTRACTION OF ROOTS IN GARSIDE GROUPS

EXTRACTION OF ROOTS IN GARSIDE GROUPS

ABSTRACT V. B. Styshnev showed in [9] that the existence of n -th roots for a braid is decidable. Garside groups have been introduced in [2] and [3] as a natural proper generalization of Artin groups of finite type. We have to construct a new proof to extend Styshnev's decidability result to Garside groups, as several specific properties of braids used in [9] fail in our case. We show that, under the assumption of a finiteness property of conjugacy, the problem is decidable.

Herve Sibert | H. Sibert

[1] David B. A. Epstein,et al. Word processing in groups , 1992 .

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

[3] Matthieu Picantin,et al. THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS , 2001 .

[4] Matthieu Picantin. Petits groupes gaussiens , 2000 .

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

[6] Egbert Brieskorn,et al. Artin-Gruppen und Coxeter-Gruppen , 1972 .

[7] Patrick Dehornoy. Groupes de Garside , 2001 .

[8] Patrick Dehornoy,et al. Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups , 1999 .