ON ALGORITHMIC PROBLEMS IN COXETER GROUPS

The main algorithmic problems of group theory posed by M. Dehn are the problem of words, the problem of the conjugation of words for finitely presented groups, and the group’s isomorphism problem. Among the works related to the study of the M. Dehn’s problems, the most outstanding ones are the work of P. S. Novikov who proved the undecidability of the problem of words and the conjugacy problem for finitely presented groups as well as the undecidability of the problem of isomorphism of groups. In this regard, the main algorithmic problems and their various generalizations are studied in certain classes of groups. Coxeter groups were introduced by H. S. M. Coxeter: every reflection group is a Coxeter group if its generating elements are reflections with respect to hyperplanes limiting its fundamental polyhedron. H. S. M. Coxeter listed all the reflection groups in three-dimensional Euclidean space and proved that they are all Coxeter groups and every finite Coxeter group is isomorphic to some reflection group in the three-dimensional Euclidean space which elements have a common fixed point. In an algebraic aspect Coxeter groups are studied starting with works by J. Tits who solved the problem of words in certain Coxeter groups. The article describes the known results obtained in solving algorithmic problems in Coxeter groups; the main purpose of the paper is to analyze of the results of solving algorithmic problems in Coxeter groups that were obtained by members of the Tula algebraic school ’Algorithmic problems of theory of the groups and semigroups ’ under the supervision of V. N. Bezverkhnii. It reviews assertions and theorems proved by the authors of the article for the various classes of Coxeter groups: Coxeter groups of large and extra-large types, Coxeter groups with a tree-structure, and Coxeter groups with n-angled structure. The basic approaches and methods of evidence among which the method of diagrams worked out by van Kampen, reopened by R. Lindon and refined by V. N. Bezverkhnii concerning the introduction of R-cancellations, special R-cancellations, special ring cancellations as well as method of graphs, method of types worked out by V. N. Bezverkhnii, method of special set of words designed by V. N. Bezverkhnii on the basis of the generalization of Nielsen method for free construction of groups. Classes of group considered in the article include all Coxeter groups which may be represented as generalized tree structures of Coxeter groups formed from Coxeter groups with tree structure with replacing some vertices of the corresponding tree-graph by Coxeter groups of large or extra-large types as well as Coxeter groups with n-angled structure.

1. Coxeter, H. S. M., 1934, “Discrete groups generated by reflections“, Ann. Math., vol. 35, pp. 588-621.

2. Tits, J., 1962, “Groupes simples et geometries associees“, Proc. Int. Congress Math. Stocholm, pp. 197-221.

3. Schupp, P., 2002, “Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability“, arXiv math. GR/0203020, vol. 1, pp. 1–21.

4. Appel, К. & Schupp, P., 1983, “ Artins groups and infinite Coxter groups“, Ivent. Math., , vol. 72, pp. 201-220.

5. Bezverkhnii, V. N. 1986,“ Solution of the conjugacy problem for words in Artin groups and Coxeter groups of large type,“ Algorithmic problems of theory of groups and semigroups, Tula: TSPU, pp. 26-61.

6. Kapovich, I. & Schup, P., 2004, “Bounded rank subgroups of Coxeter groups, Artin groups and one-relator groups with torsion“, London Math. Soc., vol. 88, pp. 89-113.

7. Bezverkhnii, V. N. & Dobrynina, I. V., 2003,“Solution of the conjugacy problem for words in Coxeter groups of large type“, Chebyshevskii Sb., , vol. 4, no. 1, pp. 10–33.

8. Bezverkhnii, V. N. & Dobrynina, I.V., 2005, “Solution of the generalized conjugacy problem for words in Coxeter groups of large type“, Diskr. Mat., vol. 17, no. 3, pp. 123–145.

9. Bezverkhnii, V. N. & Dobrynina, I. V., 2003, “On elements of finite order in Coxeter groups of large type“, Izvestia of Tula state University. Ser. Math. Mechanics. Informatics, vol. 9, no. 1, pp. 13-22.

10. Bezverkhnii, V. N. & Dobrynina, I. V., 2004, “Solution the problem of occurrence in a cyclic subgroup in the Coxeter groups of large type“, Izvestia of the Tula state University. Ser. Math. Mechanics. Informatics, vol. 10, no. 1, pp. 23-37.

11. Bezverkhnii, V. N. & Dobrynina, I. V., 2004, “Solution of the power conjugacy search problem in a cyclic subgroup in in Coxeter groups of large type“, Izvestia of the Tula state University. Ser. Math. Mechanics. Informatics, vol. 10, no. 1, pp. 38-46.

12. Bezverkhnii, V. N. & Dobrynina, I. V., 2008,“ A solution of the power conjugacy problem for words in the Coxeter groups of extra large type“, Diskr. Mat., vol. 20, no. 3, pp. 101–110.

13. Dobrynina, I. V., 2008, “On subgroups in Coxeter groups of extra large type“, Chebyshevskii Sb., vol. 9, no. 1, pp. 9-15.

14. Bezverkhnii, V. N. & Inchenko O. V., 2008, “ Centralizer of elements of finite order of a finitely generated Coxeter group with a tree-structure“ , Chebyshevskii Sb., vol. 9, no. 1, pp. 17-28.

15. Inchenko O. V. 2008, “ Problem of generalized conjugacy of words in Coxeter’s groups with tree-structure“ , Izvestia of Tula state University. Natural science, no. 2, pp. 40-48.

16. Bezverkhnii, V. N., 1986, “ Solution of the problem of inclusion in some class of groups with one relation “ , Algorithmic problems of theory of groups and semigroups, Tula: TSPU, pp. 3-22.

17. Bezverkhnii, V. N., 1998, “ On the intersection subgroups

18. Bezverkhnii, V. N. & Inchenko O. V., 2009,“ Problem of intersection of finite defined subgroups in Coxeter groups with tree-structure“ , Izvestiya of Tula State University. Natural sciences, no. 2, pp.16-31.

19. Inchenko O.V., 2016, “ On problem of intersection of the adjacency classes of finitely generated subgroups of Coxeter group with tree-structure “, Chebyshevskii Sb., pp. 146-162.

20. Bezverkhnii, V. N. & Inchenko O.V., 2010, “ Conjugacy problem of subgroups in finitely generated Coxeter groups with tree-structure “ , Chebyshevskii Sb., vol. 11, no. 3, pp. 32-56.

21. Bezverkhnii, V. N. 1981, “Solution of the problem of inclusion of subgroups in one class

22. Bezverkhnii, V. N. & Dobrynina, I. V., 2014, “On freedom problem in Coxeter groups with tree-structure“, Izvestiya of Tula state University. Natural science, no. 1-1, pp. 5-13.

23. Dobrynina, I. V., 2016, “On normalizers in some Coxeter groups“, Chebyshevskii Sb., vol. 17, no. 2, pp. 113–127.

24. Dobrynina, I. V., 2016, “On construction of Normalizer of finitely generated subgroups in the Coxeter group with tree-structure“, Research in algebra, number theory, functional analysis and related issues, no. 8, pp. 26-28.

25. Dobrynina, I. V. & Inchenko, O. V., 2015, “On some problem in Coxeter groups with a tree structure“, Algorithmic problems in algebra and the theory of computation. International scientific conference dedicated to 75-th anniversary of D. I. Moldavanskii, Ivanovo: IVGU, pp. 35-40.

26. Bezverkhnii, V. N. & Dobrynina, I. V., 2016, “On construction of isolator of subgroup in some class of Coxeter groups“, Proceedings of the international conference on algebra, analysis and geometry, Kazan: Kazan University, pp. 108-109.

27. Bezverkhnii, V.N.& Bezverkhnyaya, N. B., 2015, “Problem of equality and conjugacy of words in a certain class of Artin groups and Coxeter“, Algorithmic problems in algebra and the theory of computation. International scientific conference dedicated to 75-th anniversary of D. I. Moldavanskii, Ivanovo: IVGU, pp. 11-16.

28. Bezverkhnii, V. N. & Bezverkhnyaya, N. B., 2016, “Problem of equality and conjugacy of words in Artin groups, Coxeter

29. Bezverkhnii, V. N. & Ustyan, A. E., 2001, “Problem of power conjugation of the words in the Artin monoids of large type“, Algorithmic problems of theory of groups and semigroups, Tula:TSPU, pp. 139-164.

30. Bezverkhnii, V. N. & Ustyan, A. E., 2013, “Generalizations of theorems of Magnus and Greendlinger“, Chebyshevskii Sb., vol. 14, no. 3, pp. 20–33.