Lobachevskii Journal of Mathematics

, Volume 39, Issue 1, pp 51–53 | Cite as

On Conjugacy Finite Sets of Subgroups in Some Class of Coxeter Groups

Article

Abstract

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.

Keywords and phrases

Coxeter group tree structure amalgamated algorithmic problems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. S.M. Coxeter, “Discrete groups generated by reflections,” Ann.Math. 35, 588–621 (1934).MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    K. Appel and P. Schupp, “Artins groups and infnite Coxter groups,” Ivent.Math. 72, 201–220 (1983).CrossRefMATHGoogle Scholar
  3. 3.
    V. N. Bezverkhnii and I. V. Dobrynirina, “Solution of the conjugacy problem for words in Coxeter groups of large type,” Chebyshev. Sb. 4 (4), 10–33 (2003).MathSciNetMATHGoogle Scholar
  4. 4.
    V. N. Bezverkhnii and I. V. Dobrynirina, “Solution of the generalized conjugacy problem for words in Coxeter groups of large type,” Diskret.Mat. 17 (3), 123–145 (2005).MathSciNetCrossRefGoogle Scholar
  5. 5.
    V. N. Bezverkhnii, “On Artin groups and Coxeter groups with tree structure,” in Proceedings of the 5th International Conference on Algebra and Number Theory: Modern Problems and Applications, 2003, pp. 33–34.Google Scholar
  6. 6.
    V. N. Bezverkhnii and O. V. Inchenko, “Conjugacy problem of subgroups in finitely generated Coxeter groups with tree structure,” Chebyshev. Sb. 11 (3), 32–56 (2010).MATHGoogle Scholar
  7. 7.
    V. N. Bezverkhnii and O. V. Inchenko, “The problem of intersection of finite generated subgroups in Coxeter groups with tree structure,” Izv. Tula Univ., Estestv. Nauki 2, 16–31 (2009).MATHGoogle Scholar
  8. 8.
    V. N. Bezverkhnii and I. V. Dobrynirina, “On the freedom problem in Coxeter groups with tree structure,” Izv. Tula Univ., Estestv. Nauki 1 (1), 5–13 (2014).Google Scholar
  9. 9.
    V. N. Bezverkhnii, “Solution of occurrence problem in some classes of groups with one relation,” in Algorithmic Problems of Theory of Groups and Semigroups (Tula Gos. Ped. Univ. im. L. Tolstogo, Tula, 1986), pp. 3–21 [in Russian].Google Scholar
  10. 10.
    O. V. Inchenko, “On problem of intersection of the adjacency classes of finitely generated subgroups in Coxeter groups with tree structure,” Chebyshev. Sb. 17, 146–161 (2016).MathSciNetGoogle Scholar
  11. 11.
    I. V. Dobrynirina, “On normalizers of some Coxeter groups,” Chebyshev. Sb. 17 (2), 113–127 (2016).MathSciNetGoogle Scholar
  12. 12.
    I. S. Bezverkhnyaya, “On conjugacy of finite sets of subgroups in free product of groups,” in Algorithmic Problems of Theory of Groups and Semigroups (Tula Gos. Ped. Univ. im. L. Tolstogo, Tula, 1981), pp. 102–116 [in Russian].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Tula State Lev Tolstoy Pedagogical UniversityTulaRussia
  2. 2.Tula State UniversityTulaRussia

Personalised recommendations