On Conjugacy Finite Sets of Subgroups in Some Class of Coxeter Groups
- 作者: Dobrynina I.1, Inchenko O.2
-
隶属关系:
- Tula State Lev Tolstoy Pedagogical University
- Tula State University
- 期: 卷 39, 编号 1 (2018)
- 页面: 51-53
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/200836
- DOI: https://doi.org/10.1134/S1995080218010080
- ID: 200836
如何引用文章
详细
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.
作者简介
I. Dobrynina
Tula State Lev Tolstoy Pedagogical University
编辑信件的主要联系方式.
Email: dobrynirina@yandex.ru
俄罗斯联邦, pr. Lenina 125, Tula, 300026
O. Inchenko
Tula State University
Email: dobrynirina@yandex.ru
俄罗斯联邦, pr. Lenina 92, Tula, 300012