Email this article On Conjugacy Finite Sets of Subgroups in Some Class of Coxeter Groups
- Authors: Dobrynina I.V.1, Inchenko O.V.2
-
Affiliations:
- Tula State Lev Tolstoy Pedagogical University
- Tula State University
- Issue: Vol 39, No 1 (2018)
- Pages: 51-53
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/200836
- DOI: https://doi.org/10.1134/S1995080218010080
- ID: 200836
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
Keywords
About the authors
I. V. Dobrynina
Tula State Lev Tolstoy Pedagogical University
Author for correspondence.
Email: dobrynirina@yandex.ru
Russian Federation, pr. Lenina 125, Tula, 300026
O. V. Inchenko
Tula State University
Email: dobrynirina@yandex.ru
Russian Federation, pr. Lenina 92, Tula, 300012
