Skip to main content
SpringerLink
Log in

On Dehn's algorithm and the conjugacy problem

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliography

  1. Dehn, M.: Transformation der Kurven auf zweiseitigen Flächen. Math. Ann.72, 413–421 (1912).

    Google Scholar 

  2. —— Über unendliche diskontinuierliche Gruppen. Math. Ann.71, 116–144 (1911).

    Google Scholar 

  3. Greendlinger, M.: On Dehn's algorithms for the word problem. Comm. Pure Appl. Math.13, 67–83 (1960).

    Google Scholar 

  4. —— On Dehn's algorithms for the conjugacy and word problems with applications. Comm. Pure Appl. Math.13, 641–677 (1960).

    Google Scholar 

  5. —— Solutions of the word problems for a class of groups by means of Dehn's algorithm, and of the conjugacy problem by means of a generalization of Dehn's algorithm. Doklady Akad. Nauk SSSR154, 507–509 (1964).

    Google Scholar 

  6. —— Solution of the conjugacy problem for a class of groups coinciding with their anti-centers, by means of the generalized Dehn algorithm. Doklady Akad. Nauk SSSR158, 1254–1257 (1964).

    Google Scholar 

  7. —— On the word problem and the conjugacy problem. Izv. Akad. Nauk SSSR Ser. Mat.29, 245–268 (1965).

    Google Scholar 

  8. Lyndon, R. C.: On Dehn's algorithm. Math. Ann.166, 208–228 (1966).

    Google Scholar 

  9. Ore, O.: Theory of graphs. Providence, 1962.

  10. Schiek, H.: Ähnlichkeitsanalyse von Gruppenrelationen. Acta Math.96, 157–252 (1956).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Illinois, 61801, Urbana, Illinois

    Paul E. Schupp

Authors
  1. Paul E. Schupp
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The author is greatly indebted to the National Science Foundation which supported the work done in this paper. Part of this work was done at Queen Mary College, University of London. The author would like to thank all the members of the Department of Mathematics of Queen Mary College for their kindness and hospitality.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schupp, P.E. On Dehn's algorithm and the conjugacy problem. Math. Ann. 178, 119–130 (1968). https://doi.org/10.1007/BF01350654

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01350654

Keywords

Search

Navigation