On problem of generalized conjugation of words in a generalized tree structures of Coxeter groups

V. N. Bezverkhnii ; I. V. Dobrynina

Čebyševskij sbornik, Tome 19 (2018) no. 3, pp. 135-147.

Résumé

The main algorithmic problems of group theory are the problems of words, conjugacy of words and the problem of isomorphism of groups. This algorithmic problems in the class of finitely presented groups are unsolvable. So the main algorithmic problems and their various generalizations are studied in certain classes of groups. Coxeter groups have been studied since 1934, and in the algebraic aspect — since 1962. The problems of words and conjugacy of words are algorithmically solvable in these groupss but the problem of occurrence is unsolvable. K. Appel and P. Schupp defined the class of Coxeter groups extra- large type in 1983. V. N. Bezverhny defined the Coxeter groups with a tree structure in 2003. The article discusses the generalized tree structures of Coxeter groups, which are the tree product of Coxeter groups of extra large type and Coxeter groups with a tree structure. The generalized tree structure of Coxeter groups, as well as the Coxeter group of extra large type, and a Coxeter group with a tree structure, refer to hyperbolic groups, so most of algorithmic problems algorithmically solvable, in particular, the problem of generalized conjugacy of words. The authors propose In this paper an original method for proving algorithmic solvable of the problem of generalized conjugacy of words in tree structures of Coxeter groups. This method uses G. S. Makanin's approach applied by Him to prove the finite generation of the normalizer of an element in braid groups. In addition, in this paper we show that the centralizer of a finitely generated subgroup in a generalized wood structure of Coxeter groups is finitely generated and there is an algorithm writing out its generators.

Détail

Keywords: algorithmic problems, Coxeter group, generalized conjugation, tree product of groups, centralizer.

Bibliographie

[1] M. Dehn, “Uber unendliche diskontinuierliche Gruppen”, Math. Annal., 71 (1912), 116–144 | MR | Zbl

[2] Novikov P. S., “On the algorithmic unsolvability of the word problem in group theory”, Trudy Mat. Inst. Steklov, 44 (1955), 3–143 | MR

[3] H. S. M. Coxeter, “Discrete groups generated by reflections”, Ann. Math., 35 (1934), 588–621 | MR

[4] J. Tits, “Groupes simples et geometries associees”, Proc. Int. Congress Math. (Stocholm, 1962), 197–221 | MR | Zbl

[5] P. Schupp, Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability, 2002, 21 pp., arXiv: math.GR/0203020 | MR

[6] K. Appel, P. Schupp, “Artins groups and infinite Coxter groups”, Ivent. Math., 72 (1983), 201–220 | MR | Zbl

[7] P. Bahls, The isomorphism problem in Coxeter groups, Imperial College Press, London, 2005 | MR | Zbl

[8] Bezverkhnii V. N., Bezverkhnyaya N. B., Dobrynina I. V., Inchenko O. V., Ustyan A. E., “On algorithmic problems in Coxeter groups”, Chebyshevskii Sb., 17:4 (2016), 23–50 | MR | Zbl

[9] Lysenok I. G., “On some algorithmic properties of hyperbolic groups”, Math. USSR-Izv., 35:1 (1990), 145–163 | MR | Zbl | Zbl

[10] D. J. Buckley, Derek F. Holt, “The conjugacy problem in hyperbolic groups for finite lists of group elements”, Int. J. of Algebra and Comput., 23:5 (2013), 1127–1150 | MR | Zbl

[11] Makanin G. S., “On normalizers in the braid group”, Math. USSR-Sb., 15:2 (1971), 167–175 | MR | Zbl

[12] Bezverkhnii V. N., “Solution of the problem of generalized conjugacy of words in $C(p) \ T (q)$-groups”, Izvestia of Tula state University. Ser. Math. Mechanics. Informatics, 4 (1998), 5–13 | MR

[13] Dobrynina I. V., “On algorithmic problems in generalized tree structures of Coxeter groups”, Chebyshevskii Sb., 19:2 (2018), 10–33

[14] R. Lyndon, P. Schupp, Combinatorial group theory, Mir, M., 1980 pp.

[15] Inchenko O. V., “Problems of words and conjugacy of words in Coxeter groups with a tree structure”, Chebyshevskii Sb., 6:2 (2005), 81–90 | MR | Zbl

[16] Bezverkhnii V. N., Dobrynina I. V., “A solution of the power conjugacy problem for words in the Coxeter groups of extra large type”, Diskr. Mat., 20:3 (2008), 101–110 | Zbl

[17] Bezverkhnii V. N., Dobrynina I. V., “On elements of finite order in Coxeter groups of large type”, Izvestia of Tula state University. Ser. Math. Mechanics. Informatics, 9:1 (2003), 13–22 | MR

[18] Bezverkhnii V. N., Inchenko O. V., “On torsion in Coxeter groups with tree structure”, Chebyshevskii Sb., 6:1 (2005), 5–12 | MR | Zbl

[19] Bezverkhnii V. N., Dobrynina I. V., “Solution of the conjugacy problem for words in Coxeter groups of large type”, Chebyshevskii Sb., 4:1 (2003), 10–33 | MR | Zbl

[20] Bezverkhnii V. N., Inchenko O. V., “Power conjugacy problem for words in Coxeter groups with tree structure”, Izvestia of Tula state University. Ser. Math. Mechanics. Informatics, 11 (2005), 63–75

[21] Bezverkhnii V. N., Dobrynina I. V., “Solution of the generalized conjugacy problem for words in Coxeter groups of large type”, Diskr. Mat., 17:3 (2005), 123–145 | Zbl