🔧На сайте запланированы технические работы
25.12.2025 в промежутке с 18:00 до 21:00 по Московскому времени (GMT+3) на сайте будут проводиться плановые технические работы. Возможны перебои с доступом к сайту. Приносим извинения за временные неудобства. Благодарим за понимание!
🔧Site maintenance is scheduled.
Scheduled maintenance will be performed on the site from 6:00 PM to 9:00 PM Moscow time (GMT+3) on December 25, 2025. Site access may be interrupted. We apologize for the inconvenience. Thank you for your understanding!

 

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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access 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.

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

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.