Chebyshevskii Sbornik
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Chebyshevskii Sb.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Chebyshevskii Sb., 2014, Volume 15, Issue 2, Pages 50–65 (Mi cheb340)  

The problem of the conjugation of words in $HNN$-extension with a finite number entrance letters of a tree product of cyclic groups with cyclic amalgamation

E. S. Logacheva

Tula State Pedagogical University

Abstract: In the work of the positive solution of the conjugation of words in $HNN$-extension with the system of entrance letters. The base $HNN$-extensions is a wood product of the infinite cyclic groups with cyclic subgroups. The result is a generalization of the conjugacy problem in $HNN$-extension of a wood product of cyclic groups associated cyclic subgroups with one entrance letter.
The conjugacy problem for words is of interest in free designs groups. The problem was solved in free groups with cyclic subgroups by S. Lipshutz, in the $HNN$-extension of a free group by an associate of cyclic subgroups by A. Friedman, in $HNN$-extension of a tree product with the association cyclic groups associated with cyclic subgroups by author with V. N. Bezverkhny.
In this paper a positive solution of the conjugation problem for words in $HNN$-extension with the system of entrance letters. The base $HNN$-extensions is a tree product of the infinite cyclic groups with cyclic subgroups. The result is a generalization of the conjugacy problem in $HNN$-extension of a wood product of cyclic groups associated cyclic subgroups with one entrance letters. Assertion is proved for any number of entrance letters using the method of mathematical induction. In the proof of the main theorem the author proved self result assertion :
  • algorithmic solvability of intersection of finitely generated subgroup of the core group with an associated sub-group;
  • algorithmic solvability of intersection of the related class of finitely generated subgroup of the core group with an associated sub-group.
Bibliography: 13 titles.

Keywords: the group, the subgroup, the $HNN$-extension, the tree product, the conjugacy problem.

Full text: PDF file (249 kB)
References: PDF file   HTML file
UDC: 519.4
Received: 24.04.2014

Citation: E. S. Logacheva, “The problem of the conjugation of words in $HNN$-extension with a finite number entrance letters of a tree product of cyclic groups with cyclic amalgamation”, Chebyshevskii Sb., 15:2 (2014), 50–65

Citation in format AMSBIB
\Bibitem{Log14}
\by E.~S.~Logacheva
\paper The problem of the conjugation of words in $HNN$-extension with a finite number entrance letters of a tree product of cyclic groups with cyclic amalgamation
\jour Chebyshevskii Sb.
\yr 2014
\vol 15
\issue 2
\pages 50--65
\mathnet{http://mi.mathnet.ru/cheb340}


Linking options:
  • http://mi.mathnet.ru/eng/cheb340
  • http://mi.mathnet.ru/eng/cheb/v15/i2/p50

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:137
    Full text:110
    References:30

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021