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