Solution of the generalized conjugacy problem for words in Coxeter groups of large type
Diskretnaya Matematika, Tome 17 (2005) no. 3, pp. 123-145
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.
@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},
publisher = {mathdoc},
volume = {17},
number = {3},
year = {2005},
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 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_2005_17_3_a12/ LA - ru ID - DM_2005_17_3_a12 ER -
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/