Processing math: 100%
Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Sbornik: Mathematics, 1999, Volume 190, Issue 8, Pages 1077–1130
DOI: https://doi.org/10.1070/sm1999v190n08ABEH000419
(Mi sm419)
 

This article is cited in 57 scientific papers (total in 57 papers)

On subgroups of R. Thompson's group F and other diagram groups

V. S. Gubaa, M. V. Sapirb

a Vologda State Pedagogical University
b Vanderbilt University
References:
Abstract: In the present paper we continue our study of an interesting class of groups, the so-called diagram groups. In simple terms, a diagram is a labelled planar graph bounded by two paths (the top and the bottom ones). Multiplication of diagrams is defined naturally: the top path of one diagram is identified with the bottom path of another diagram, and then pairs of “cancellable” cells are deleted. Each diagram group is determined by some alphabet X containing all possible labels of edges, a set of relations R={ui=vi:i=1,2,} defining all possible labels of cells, and a word w over X that is the label of the top and bottom paths of diagrams. Diagrams may be regarded as two-dimensional words, and diagram groups as two-dimensional analogues of free groups. In our previous paper we showed that the class of diagram groups contains many interesting groups, including the famous R. Thompson's group F (which corresponds to the simplest set of relations {x=x2}); this class is closed under direct and free products and a number of other constructions. In this article we study mainly subgroups of diagram groups. We show that not every subgroup of a diagram group is itself a diagram group (an answer to a question from the previous paper). We prove that every nilpotent subgroup of a diagram group is Abelian, every Abelian subgroup is free, but even the group F contains soluble subgroups of any derived length. We study also distortion of subgroups in diagram groups, including the group F. It turns out that the centralizers of elements and Abelian subgroups in diagram groups are always embedded without distortion. But the group F contains distorted soluble subgroups.
Received: 19.11.1998 and 16.04.1999
Bibliographic databases:
UDC: 519.4
MSC: Primary 20F05, 20F32, 20F34; Secondary 20E05, 20E06, 20E22, 20F06, 20F10, 20F38, 20M05
Language: English
Original paper language: Russian
Citation: V. S. Guba, M. V. Sapir, “On subgroups of R. Thompson's group F and other diagram groups”, Sb. Math., 190:8 (1999), 1077–1130
Citation in format AMSBIB
\Bibitem{GubSap99}
\by V.~S.~Guba, M.~V.~Sapir
\paper On subgroups of R.~Thompson's group~$F$ and other diagram groups
\jour Sb. Math.
\yr 1999
\vol 190
\issue 8
\pages 1077--1130
\mathnet{http://mi.mathnet.ru/eng/sm419}
\crossref{https://doi.org/10.1070/sm1999v190n08ABEH000419}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1725439}
\zmath{https://zbmath.org/?q=an:1095.20021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000084021300007}
\elib{https://elibrary.ru/item.asp?id=13996313}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0033240350}
Linking options:
  • https://www.mathnet.ru/eng/sm419
  • https://doi.org/10.1070/sm1999v190n08ABEH000419
  • https://www.mathnet.ru/eng/sm/v190/i8/p3
  • This publication is cited in the following 57 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математический сборник - 1992–2005 Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:931
    Russian version PDF:340
    English version PDF:45
    References:87
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025