Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2016, Volume 28, Issue 1, Pages 3–18
DOI: https://doi.org/10.4213/dm1355 (Mi dm1355) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Conjugacy word problem in the tree product of free groups with a cyclic amalgamation

V. N. Bezverkhnii, E. S. Logacheva

Tula State Pedagogical University
Full-text PDF (468 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1355
Abstract: The conjugacy word problem in the tree product of free groups with a cyclic amalgamation is solved in the positive. This result generalizes the known result obtained by S. Lipschutz for the free product of two free groups with cyclic amalgamation. Solution of the main problem involves proving the solvability of the problem of intersection of a finitely generated subgroup of a given class of groups with a cyclic subgroup belonging to the factor of the main group; the solvability of the problem of intersection of a coset of a finitely generated subgroup with a cyclic subgroup belonging to a free factor.
Keywords: group, subgroup, conjugacy problem, free product with amalgamation.
Funding agency Grant number
Russian Foundation for Basic Research 15-41-03222 р_центр_а
This work was financially supported by the Russian Foundation for Basic Research, (grant в„–15-41-03222 r_centre_a).
Received: 12.09.2014
English version:
Discrete Mathematics and Applications, 2016, Volume 26, Issue 6, Pages 309–321
DOI: https://doi.org/10.1515/dma-2016-0027
Bibliographic databases:
Document Type: Article
UDC: 519.4
Language: Russian
Citation: V. N. Bezverkhnii, E. S. Logacheva, “Conjugacy word problem in the tree product of free groups with a cyclic amalgamation”, Diskr. Mat., 28:1 (2016), 3–18; Discrete Math. Appl., 26:6 (2016), 309–321
Citation in format AMSBIB
\Bibitem{BezLog16}
\by V.~N.~Bezverkhnii, E.~S.~Logacheva
\paper Conjugacy word problem in the tree product of free groups with a cyclic amalgamation
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 1
\pages 3--18
\mathnet{http://mi.mathnet.ru/dm1355}
\crossref{https://doi.org/10.4213/dm1355}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3527006}
\elib{https://elibrary.ru/item.asp?id=25707490}
\transl
\jour Discrete Math. Appl.
\yr 2016
\vol 26
\issue 6
\pages 309--321
\crossref{https://doi.org/10.1515/dma-2016-0027}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000390939700001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85007586323}
Linking options:
  • https://www.mathnet.ru/eng/dm1355
  • https://doi.org/10.4213/dm1355
  • https://www.mathnet.ru/eng/dm/v28/i1/p3
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:505
    Full-text PDF :150
    References:86
    First page:74
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024