Abstract
In this talk I sketch a proof of the following theorem: Theorem. One-relator groups have solvable conjugacy problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Juhasz, A unified small cancellation theory I,Journal of the London Mat. Soc. (to appear).
R.C. Lyndon, On Dehn’s algorithm, Math. Ann. 166 (1966), 208–228.
R.C. Lyndon and P.E. Schupp, “Combinatorial Group Theory,” Springer-Verlag, Berlin-New York, 1977.
B.B. Newman, “Aspects of One-Relator Groups,” Thesis, University of Queensland, 1968.
P. Schupp, On Dehn’s algorithm and the conjugacy problem, Math. Ann. 178 (1966), 119–130.
S. Pride, Small cancellation conditions satisfied by one-relator groups, Math. Z. 184 (1983), 283–286.
E. Rips, Generalized small cancellation theory and application I, The word problem, Israel J. Math. 41 (1982), p. 1–146.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Juhasz, A. (1992). Solution of the Conjugacy Problem in One-Relator Groups. In: Baumslag, G., Miller, C.F. (eds) Algorithms and Classification in Combinatorial Group Theory. Mathematical Sciences Research Institute Publications, vol 23. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9730-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9730-4_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9732-8
Online ISBN: 978-1-4613-9730-4
eBook Packages: Springer Book Archive