О ПРОБЛЕМЕ ПЕРЕСЕЧЕНИЯ КЛАССОВ СМЕЖНОСТИ КОНЕЧНО ПОРОЖДЕННЫХ ПОДГРУПП В ГРУППЕ КОКСТЕРА С ДРЕВЕСНОЙ СТРУКТУРОЙ

Abstract

P. S. Novikov in 1955–1956 showed the unsolvability of the main algorithmic problems in class of finite defined groups. In this connection there was important task of consideration of these problems in specific classes of finite defined groups. Thus, class of finite defined groups of Coxeter represents scientific interest. The class of groups of Coxeter was defined by H. S. M. Coxeter in 1934. The classe of finitely generated groups of Coxeter with tree structure was defined by V. N. Bezverkhnii in 2003. Let finitely generated group of Coxeter with tree structure is defined by presentation G = ha1, ...an; (ai) 2 ,(aiaj ) mij , i, j ∈ 1, n, i 6= ji where mij — number which corresponds to a symmetric matrix of Coxeter. At that, if i 6= j, that mij = mji, mij > 2. If mij = ∞, that between ai and aj relation does not exist . The group matches finite coherent tree-graph Γ such that: if tops of some edge -e of graf Г are elements ai and aj , that the edge e matches relation (aiaj ) mij = 1. On the other hand group G may be represented as wood product of the two-generated groups of Coxeter, which are united by final cyclic subgroups. In this case, we will pass from graf Г of group G to graf Γ as follows: we associate tops of some edge e of graf Γ groups of Coxeter with two generating elements Gji = haj , ai ; (aj ) 2 ,(ai) 2 ,(ajai) mji i and Gik = hai , ak; (ai) 2 ,(ak) 2 ,(aiak) mik i, and edge e — cyclic subgroup hai ; (ai) 2 i. The problem of intersection of the adjacency classes of finitely generated subgroups is that you need to find an algorithm that will help determine empty or not intersection w1H1 ∩ w2H2, where H1 and H2 any subgroup of group G and w1, w2 ∈ G. Previously, the author proved the solvability of this problem for free product with association of two Coxeter’s groups with two generating element. In the article author shows solvability of a problem of intersection of the adjacency classes of finite number of finitely generated subgroups of Coxeter’s group with tree structure. For this purpose group G was presented as wood product of n two-generated groups of Coxeter, which are united by finite cyclic subgroups. To prove of this result, the author used the method of special sets and method of types. These methods were defined V. N. Bezverkhnii. He used these methods for research of various algorithmic problems in free constructions of groups.