🔧На сайте запланированы технические работы
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


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

I. Dobrynina

Tula State Lev Tolstoy Pedagogical University

Autor responsável pela correspondência
Email: dobrynirina@yandex.ru
Rússia, pr. Lenina 125, Tula, 300026

O. Inchenko

Tula State University

Email: dobrynirina@yandex.ru
Rússia, pr. Lenina 92, Tula, 300012

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018