Solution of the Membership Problem for Magnus Subgroups in Certain One-Relator Free Products

  • Arye Juhász
Conference paper
Part of the Trends in Mathematics book series (TM)


Let\( \mathcal{P} = \left\langle {X|\mathcal{R}} \right\rangle \) be a presentation of a group G. The most fundamental decision problem for \( \mathcal{P} \)is the Word Problem which asks for an algorithm to decide whether a given word on X represents the neutral element 1 of the group G. This problem is known to be unsolvable in general, however, for important classes of groups, it has been solved (see [L-S]). The membership problem (or generalized word problem) for \( \mathcal{P} \) and a subgroup H of G asks for an algorithm to decide whether a given word on X represents an element of H. Thus, the word problem is the membership problem for the trivial subgroup, {1 }, of G. One of the classes of groups in which the word problem has been solved is the class of groups presented by a single defining relator R (one-relator groups). The word problem for one-relator groups was solved by W. Magnus [M]. An important ingredient of his proof, which is the basis for many classical and more recent results, is focusing on subgroups of G which are generated by proper subsets of X, which miss at least one letter from X that occurs in R ±1. These subgroups are called Magnus Subgroups. In the course of the solution of the word problem, Magnus solved the Membership Problem for Magnus Subgroups. For more on the Membership Problem see [K-M-W] and references therein. See also [L-S].


Word Problem Free Product Double Point Primary Vertex Secondary Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [D-H]
    A. Duncan and J. Howie, One relator products with high-powered relators, in: G.A. Niblo and M.A. Roller (eds.), LMS Lecture Notes, No. 181, (1993), 48–74.Google Scholar
  2. [H]
    J. Howie, How to generalise one-relator groups theory, in: Ann. Math. Studies 111 (1987), 89–115.Google Scholar
  3. [J1]
    A. Juhász, Small cancellation theory with a unified small cancellation condition, J. London Math. Soc. 2(40) (1989), p. 57–79.CrossRefGoogle Scholar
  4. [J2]
    A. Juhász, A strengthened Freiheitssatz, Math. Proc. Camb. Phil. Soc. 140 (2006), p. 15–35.MATHCrossRefGoogle Scholar
  5. [J3]
    A. Juhász, On quasiconvexity of Magnus subgroups in one-relator free products, in preparation.Google Scholar
  6. [K-M-W]
    I. Kapovich, R. Wideman and A. Myasnikov, Foldings, graphs of groups and the membership problem, J. Algebra 125 (1997), 123–190.Google Scholar
  7. [L-S]
    R.C. Lyndon and P.E. Schupp, Combinatorial Group Theory, Springer Verlag, 1977.Google Scholar
  8. [M]
    W. Magnus, Das Identitätsproblem für Gruppen mit einer definierenden Relation, Math. Ann. 106 (1932), 295–307.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Birkhäuser Verlag Basel/Switzerland 2007

Authors and Affiliations

  • Arye Juhász
    • 1
  1. 1.Department of MathematicsTechnion — Israel Institute of TechnologyHaifaIsrael

Personalised recommendations