On Conjugacy Finite Sets of Subgroups in Some Class of Coxeter Groups


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##