Translator’s Introduction 5

Max Dehn

A chapter in Papers on Group Theory and Topology, 1987, pp 179-182 from Springer

Abstract: Abstract The next paper contains Dehn’s last word on the conjugacy problem for surface groups, as well as a very simple solution of the word problem. The solutions, by what is known as Dehn’s algorithm, are based on a detailed combinatorial study of closed paths in the group diagram. This study shows, in effect, that if a word for an element of the fundamental group can be reduced in length, then it can be reduced monotonically, namely by replacing any subword which is more than half the defining relator by its complement, and by trivial cancellations. (When only a conjugate of the original element is sought, the word is regarded as circular in applying these operations.)

Keywords: Fundamental Group; Word Problem; Euler Characteristic; Surface Group; Closed Path (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-4668-8_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461246688

DOI: 10.1007/978-1-4612-4668-8_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().