Abstract
Let \(G = \langle X|R\rangle\) be a group defined by a finite presentation, let A = X ∪ X -1 and let A* denote the set of words in A, including the empty word ε. For v, w ∈ A*, v = w will mean that they are equal as words, and v = G w will mean that they map onto the same element of G. We shall also use \(\bar{w}\) to denote the image of the word w in G. In this article, we shall be concerned with the following three decision 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.
Bibliography
J.W. Cannon. The combinatorial structure of cocompact discrete hyperbolic groups, Geom. Dedicata 16, 123–148 (1984).
David B. A. Epstein J.W. Cannon, D. F. Holt, S. Levy, M. S. Patterson and W. Thurston: Word Processing in Groups, Jones and Bartlett, 1992.
D. B. A. Epstein, D. F. Holt and S. E. Rees: The use of Knuth-Bendix methods to solve the word problem in automatic groups, J. Symbolic Computation 12, (1991), 397–414.
S. M. Gersten, H. B. Short: Rational Subgroups Of Biautomatic Groups, Ann. Math. 134, (1991), 125–158.
Derek F. Holt: The Warwick automatic groups software, in: Geometrical and Computational Perspectives on Infinite Groups DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25, ed. Gilbert Baumslag et. al., 1995, 69–82.
Derek F. Holt and Darren F. Hurt: Computing automatic cosec systems and subgroup presentations, to appear in J. Symbolic Computation.
John E. Hoperoft and Jeffrey D. Ullman: Introduction to automata theory, languages and computation, Addison-Wesley, 1979.
Darren F. Hurt: The Use of Knuth-Bendix Methods and Automatic Coset Systems for Solving the Generalized Word Problem and Finding Subgroup Presentations, PhD Thesis, University of Warwick, 1997.
Ilya Kapovich: Detecting quasiconvexity: algorithmic aspects, in: Geometric and Computational Perspectives on Infinite Groups, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 25, ed. Gilbert Baumslag et. al., 1995, 91–99.
R.C. Lyndon and P.E. Shupp: Combinatorial Group Theory, Springer-Verlag, Berlin-Heidelberg-New York, 1977.
Joseph J. Rotman: An Introduction to the Theory of Groups, Third Edition, Allyn and Bacon, Inc., 1984.
I. D. Redfern: Automatic Coset Systems, PhD Thesis, University of Warwick, 1993.
C.C. Sims: Computation with Finitely Presented Groups, Cambridge University Press, 1994.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this paper
Cite this paper
Holt, D.F. (1999). Decision Problems in Finitely Presented Groups. In: Dräxler, P., Ringel, C.M., Michler, G.O. (eds) Computational Methods for Representations of Groups and Algebras. Progress in Mathematics, vol 173. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8716-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8716-8_16
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9740-2
Online ISBN: 978-3-0348-8716-8
eBook Packages: Springer Book Archive