Geodesic
Solution of the generalized conjugacy problem for words in Coxeter groups of large type
Diskretnaya Matematika, Tome 17 (2005) no. 3, pp. 123-145 
V. N. Bezverkhnii; I. V. Dobrynina. Solution of the generalized conjugacy problem for words in Coxeter groups of large type. Diskretnaya Matematika, Tome 17 (2005) no. 3, pp. 123-145. http://geodesic.mathdoc.fr/item/DM_2005_17_3_a12/
@article{DM_2005_17_3_a12,
     author = {V. N. Bezverkhnii and I. V. Dobrynina},
     title = {Solution of the generalized conjugacy problem for words in {Coxeter} groups of large type},
     journal = {Diskretnaya Matematika},
     pages = {123--145},
     year = {2005},
     volume = {17},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_3_a12/}
}
TY  - JOUR
AU  - V. N. Bezverkhnii
AU  - I. V. Dobrynina
TI  - Solution of the generalized conjugacy problem for words in Coxeter groups of large type
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 123
EP  - 145
VL  - 17
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_3_a12/
LA  - ru
ID  - DM_2005_17_3_a12
ER  - 
%0 Journal Article
%A V. N. Bezverkhnii
%A I. V. Dobrynina
%T Solution of the generalized conjugacy problem for words in Coxeter groups of large type
%J Diskretnaya Matematika
%D 2005
%P 123-145
%V 17
%N 3
%U http://geodesic.mathdoc.fr/item/DM_2005_17_3_a12/
%G ru
%F DM_2005_17_3_a12

Voir la notice de l'article provenant de la source Math-Net.Ru

For a Coxeter group of large type, we give a solution of the generalised conjugacy problem for words: it is proved that the centraliser of a finitely generated subgroup is finitely generated and there exists an algorithm which yields its generators. It is shown that in the general case the centraliser of a finitely generated group is not cyclic. We construct an example of a group of this class which is not a hyperbolic group.This research was supported by the Ministry of Education of the Russian Federation, grant 02–1.1–209.

[1] Appel K., “On Artin groups and Coxeter groups of large type”, Contemp. Math., 33 (1984), 50–78 | MR | Zbl

[2] Bezverkhnii V. N., Dobrynina I. V., “Reshenie problemy sopryazhennosti slov v gruppakh Kokstera bolshogo tipa”, Chebyshevskii sbornik, 4:1(5) (2003), 10–33 | MR | Zbl

[3] Lindon R., Shupp P., Kombinatornaya teoriya grupp, Nauka, Moskva, 1980

[4] Bezverkhnii V. N., “Reshenie problemy sopryazhennosti slov v gruppakh Artina bolshogo tipa”, Algoritmicheskie problemy teorii grupp i polugrupp, Mezhvuzovskii sbornik nauchnykh trudov, Tulskii gos. ped. inst., Tula, 1986, 26–61 | MR

[5] Grindlinger M. D., “O probleme sopryazhennosti i sovpadenii s antitsentrom v teorii grupp”, Sib. matem. zhurnal, 7 (1966), 785–803 | MR

[6] Bezverkhnii V. N., “O normalizatorakh elementov v gruppakh”, Algoritmicheskie problemy teorii grupp i polugrupp, Mezhvuzovskii sbornik nauchnykh trudov, Tulskii gos. ped. inst., Tula, 1994 | MR

[7] Bezverkhnii V. N., “Reshenie obobschennoi problemy sopryazhennosti slov v $C(p)\mathbin{\}T(q)$-gruppakh”, Izv. Tulskogo gos. univ., 4:3 (1998), 5–13 | MR

[8] Bezverkhnii V. N., “Reshenie problemy obobschennoi sopryazhennosti slov v gruppakh Artina bolshogo tipa”, Fundamentalnaya i prikladnaya matem., 5:1 (1999), 1–38 | MR