On Conjugacy Finite Sets of Subgroups in Some Class of Coxeter Groups
- Autores: Dobrynina I.1, Inchenko O.2
-
Afiliações:
- Tula State Lev Tolstoy Pedagogical University
- Tula State University
- Edição: Volume 39, Nº 1 (2018)
- Páginas: 51-53
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/200836
- DOI: https://doi.org/10.1134/S1995080218010080
- ID: 200836
Citar
Resumo
The article gives an overview of algorithmic properties of Coxeter groups with tree structure. The paper considers free product of two 2-generated of Coxeter groups amalgamated by cyclic subgroup which refers to Coxeter groups with tree structure. The authors proves decidability of conjugacy problem for finite sets of subgroups in this class of groups.
Palavras-chave
Sobre autores
I. Dobrynina
Tula State Lev Tolstoy Pedagogical University
Autor responsável pela correspondência
Email: dobrynirina@yandex.ru
Rússia, pr. Lenina 125, Tula, 300026
O. Inchenko
Tula State University
Email: dobrynirina@yandex.ru
Rússia, pr. Lenina 92, Tula, 300012