Combinatorial Group Theory

  • Combinatorial Group Theory
    By Roger C. Lyndon, Paul E. Schupp

    Taussky, O., Todd, J.: Commuting bilinear transformations and matrices. J. Washington Acad. Sci. 46, 373–375 (1956). Taylor, T.: See Baumslag, G. Thompson, R. J.: A finitely presented infinite simple group. Unpublished.

  • Combinatorial Group Theory
    By Roger C. Lyndon, Paul E. Schupp

    Since a D is a simple closed path by Lemma 4.1 , there is a boundary cycle or of D. Write s = $ ( o ) and t = $ ( t ) . ... If i ( D ) = j , then t is a product of j pieces and s is a j - remnant . ... ( aD naM ) is a subword of w * = o ...

  • Combinatorial Group Theory
    By Roger C. Lyndon, Paul E. Schupp

    Cohen , D. E .: Certain subgroups of free products . ... Cohen , D. E .: Groups of cohomological dimension one ( Lecture Notes in Math . , Vol . 245 ) . ... Cohn P. M .: Generalization of a theorem of Magnus . Proc . London Math . Soc .

  • Combinatorial Group Theory: Proceedings of the AMS Special Session in Combinatorial Group Theory-infinite Groups, April 23-24, 1988
    By Benjamin Fine, Anthony M. Gaglione

    Eighteen papers presented during a special AMS session designed to draw together researchers in various areas of infinite group theory, especially combinatorial group theory, to share methods and results.

  • Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations
    By Wilhelm Magnus, Abraham Karrass, Donald Solitar

    This seminal, much-cited account begins with a fairly elementary exposition of basic concepts and a discussion of factor groups and subgroups.