TO THE 75TH ANNIVERSARY OF PROFESSOR V. N. BEZVERKHNII
https://doi.org/10.22405/2226-8383-2015-16-1-291-300
Abstract
The article is devoted to the 75th anniversary of Professor Vladimir N. Bezverkhnii. The authors made an attempt to describe the work of V. N. Bezverkhnii in the area of combinatorial group theory. Also some personal reminiscences are included. V. N. Bezverkhnii, who is a former student of Martin Greendlinger, plays major role in scientific school “Algorithmic problems in theory of groups and semigroups”. Seven his students received their PhD degrees under his supervision, and one of them became a Doctor of Science.
About the Authors
I. V. DobryninaRussian Federation
A. E. Ustyan
Russian Federation
Yu. E. Trubitsyn
Russian Federation
References
1.
2. Bezverkhnii V. N., 1981, Solution of the occurrence problem in a class of HNNgroups // Algorithmic problems of the theory of groups and semigroups. Tula State Ped. Inst. Tula. P. 20–62.
3. Bezverkhnii V. N., 1998, On intersection of subgroups in HNN-groups // Fundamental and Applied Mathematics. Vol. 4. No. 1. P. 199–222.
4. Bezverkhnii V. N., 1998, Solution of the problem of generalized conjugacy in C(p)&T(q)-groups // Proceedings of Tula State University. Mathematics. Vol. 4. P. 5–13.
5. Bezverkhnii V. N., 1999, Solution of the problem of generalized conjugacy in Artin groups of large type //Fundamental and Applied Mathematics. Vol. 5. No. 1. P. 1–38.
6. Bezverkhnii V. N., Dobrynina I. V. 1999, On the unsolvability of the conjugacy problem for subgroups of the group R5 of pure braids // Mathematical Notes. Vol. 65. No. 1–2. P. 13–19.
7. Bezverkhnii V. N., Dobrynina I. V. 2001, On width in some class of groups with two generators and one defining relation // Proceedings of the Steklov Institute of Mathematics (Supplementary issues). Suppl. 2. Р. 53–60.
8. Bezverkhnii V. N., Dobrynina I. V. 2003, Normalizers of some classes of subgroups in braid groups // Mathematical Notes. Vol. 74. No. 1–2. P. 18–29.
9. Bezverkhnii V. N., Dobrynina I. V. 2005, A solution of the generalized conjugacy problem for words in Coxeter groups of large type // Discrete Mathematics and Applications. Vol. 15. I. 6. P. 611–634.
10. Bezverkhnii V. N., Grinblat V. A. 2006, Solution of the generalized conjugacy problem for words in pure subgroups of Artin groups of finite type // Mathematical Notes. Vol. 79. No. 4–5. P. 606–613.
11. Bezverkhnii V. N., Dobrynina I. V. 2008, A solution of the power conjugacy problem for words in Coxeter groups of extra-large type // Discrete Mathematics and Applications. Vol. 18. I. 5. P. 535–544.
12. Bezverkhnii V. N., Inchenko O. V. 2010, A subgroup conjugacy problem in finitely generated Coxeter groups with tree structure // Chebyshev Sb. Vol. 11. No. 3 (35). pp. 32–56.
13. Bezverkhniy V. N., Ustyan A. E. 2013, Generalization of theorems of Magnus and Greendlinger // Chebyshev Sb. Vol. 14. N 3. P. 20–33.
14. Bezverkhnii V. N., Dobrynina I. V. 2014, On a freedom problem in Coxeter groups with tree structure // Proceedings of Tula State University. Science. No. 1–1. P. 5–13.
15. Bezverkhnii V. N., 1999, Occurrence and conjugacy problems for subgroups in some classes of groups // Doctor of Science thesis, Tula.
16. Dobrynina I. V., 2010, Solution of algorithmic problems in Coxeter groups // Doctor of Science thesis. Yaroslavl.
17. Dobrynina I. V., 1997, On subgroups in groups of pure braids and Artin groups of finite type // PhD thesis. Tula.
18. Parshikova E. V., 2001, Problems of degree and degree conjugacy in small cancellation groups C(4)&T(4) // Tula.
19. Novikova O. A., 2002, Solution of algorithmic problems in free product of groups with commuting subgroups // PhD thesis. Tula.
20. Bezverkhnyaya N. B., 2002, Hyperbolicity, SQ-universality and other properties of one-relator groups // PhD thesis. Tula.
21. Inchenko O. V., 2010, On algorithmic problems in finitely generated Coxeter groups with tree structure // PhD thesis. Tula.
22. Kuznetsova A. N., 2010, Algorithmic problems in Artin groups of large and extra-large type // PhD thesis. Tula.
23. Platonova O. Yu., 2013, Solution of algorithmic problems in Artin groups with tree structure // PhD thesis. Tula.
24. Trubitsyn Yu. E., 1996, Algorithmic problems and identities in Church-Rosser semigroups // PhD thesis. Moscow.
Review
For citations:
Dobrynina I.V., Ustyan A.E., Trubitsyn Yu.E. TO THE 75TH ANNIVERSARY OF PROFESSOR V. N. BEZVERKHNII. Chebyshevskii Sbornik. 2015;16(1):291-300. (In Russ.) https://doi.org/10.22405/2226-8383-2015-16-1-291-300
Views:
715
Email this article 