Abstract
There is a long history of mathematical interest in simple groups. Using the Higman, Neumann, and Neumann construction [3] it is easy to construct examples of infinite simple groups. For example, let C 0 be any non-trivial torsion free group. Then, by [3], there exists a torsion free group C *0 , containing C 0, in which the non-trivial elements of C 0 are all conjugate to each other. For i ∈ ℤ define C i +1 = C *0 and let K = ∪ i C i . Then K is an infinite simple group.
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
W.W. Boone and G. Higman, An algebraic characterization of the solvability of the word problem, J. Austral. Math. Soc. 18 (1974), 41–53.
K. Brown, Finiteness properties of groups, J. Pure Appl. Algebra 44 (1987), 45–75.
G. Higman, B.H. Neumann, and H. Neumann, Embedding theorems for groups, J. London Math. Soc. 24 (1949), 247–254.
G. Higman, Subgroups of finitely presented groups, Proc. Royal Soc. London Ser. A 262 (1961), 455–475.
G. Higman,“Finitely Presented Infinite Simple Groups”, Notes on Pure Mathematics 8, Australian National University, Canberra, 1974.
A.V. Kuznetsov, Algorithms as operations in algebraic systems, Izv. Akad. Nauk SSSR Ser. Mat. (1958).
C.F. Miller III, Decision problems in algebraic classes of groups (a survey), “Word Problems”, (edited by W.W. Boone, F.B. Cannonito, and R.C. Lyndon ), North Holland, Amsterdam, 1973.
E.A. Scott, A construction which can be used to produce finitely presented infinte simple groups, Journal of Algebra 90 (1984), 294–322.
E.A. Scott, The embedding of certain linear and abelian groups in finitely presented simple groups, Journal of Algebra 90 (1984), 323–332.
E.A. Scott, A finitely presented simple group with an unsolvable conjugacy problem, Journal of Algebra 90 (1984), 333–353.
R.J. Thompson, Embeddings into finitely generated groups which preserve the word problem, “Word Problems II”, (edited by S.I. Adian, W.W. Boone, and G. Higman ), North-Holland, Amsterdam, 1980.
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
Scott, E.A. (1992). A Tour Around Finitely Presented Infinite Simple 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9730-4_4
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