|
This article is cited in 11 scientific papers (total in 11 papers)
Solution of the generalized conjugacy problem for words in Coxeter groups of large type
V. N. Bezverkhnii, I. V. Dobrynina
Abstract:
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.
Received: 14.10.2003
Citation:
V. N. Bezverkhnii, I. V. Dobrynina, “Solution of the generalized conjugacy problem for words in Coxeter groups of large type”, Diskr. Mat., 17:3 (2005), 123–145; Discrete Math. Appl., 15:6 (2005), 611–634
Linking options:
https://www.mathnet.ru/eng/dm122https://doi.org/10.4213/dm122 https://www.mathnet.ru/eng/dm/v17/i3/p123
|
Statistics & downloads: |
Abstract page: | 517 | Full-text PDF : | 270 | References: | 50 | First page: | 1 |
|