Experimenting with infinite groups. I. (English) Zbl 1083.20024

Summary: A group is termed parafree if it is residually nilpotent and has the same nilpotent quotients as a given free group. Since free groups are residually nilpotent, they are parafree. Nonfree parafree groups abound and they all have many properties in common with free groups. Finitely presented parafree groups have solvable word problems, but little is known about the conjugacy and isomorphism problems. The conjugacy problem plays an important part in determining whether an automorphism is inner, which we term the inner automorphism problem. We will attack these and other problems about parafree groups experimentally, in a series of papers, of which this is the first and which is concerned with the isomorphism problem. The approach that we take here is to distinguish some parafree groups by computing the number of epimorphisms onto selected finite groups. It turns out, rather unexpectedly, that an understanding of the quotients of certain groups leads to some new results about equations in free and relatively free groups. We touch on this only lightly here but will discuss this in more depth in a future paper.


20E26 Residual properties and generalizations; residually finite groups
20-04 Software, source code, etc. for problems pertaining to group theory
20F05 Generators, relations, and presentations of groups
20F10 Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20E05 Free nonabelian groups
20E36 Automorphisms of infinite groups


Full Text: DOI Euclid EuDML


[1] DOI: 10.1112/jlms/s1-35.1.30 · Zbl 0090.24502
[2] Baumslag Gilbert, Trans. Amer. Math. Soc. 129 pp 308– (1967)
[3] DOI: 10.1090/S0002-9904-1967-11800-7 · Zbl 0153.35001
[4] DOI: 10.1090/S0002-9904-1968-12029-4 · Zbl 0176.29702
[5] DOI: 10.1002/cpa.3160210504 · Zbl 0186.32101
[6] DOI: 10.1090/S0002-9947-1969-0245653-3
[7] DOI: 10.1090/conm/169/01652
[8] Baumslag Gilbert, Journal of Group Theory (2005)
[9] Baumslag Gilbert, ”Experimenting with Infinite Groups, I: Tables.” (2004) · Zbl 1083.20024
[10] DOI: 10.1006/jsco.1996.0125 · Zbl 0898.68039
[11] Conway J. H., Atlas of Finite Groups. (1985)
[12] DOI: 10.1017/S0013091500024007 · Zbl 0908.20026
[13] GAP – Groups, Algorithms, and Programming, Version (2003)
[14] Havas George, Computational Group Theory (Durham, 1982) pp 367– (1984) · Zbl 0284.20036
[15] DOI: 10.1017/CBO9780511629259.040
[16] DOI: 10.1090/S1079-6762-98-00047-X · Zbl 0923.20016
[17] Lewis Robert H., Experiment. Math. 3 (3) pp 255– (1994)
[18] DOI: 10.1307/mmj/1028998143 · Zbl 0084.02803
[19] DOI: 10.1307/mmj/1028998766 · Zbl 0106.02204
[20] DOI: 10.1515/crll.1930.163.141 · JFM 56.0134.03
[21] Magnus: A Graphically-Oriented Software System for Computational Group Theory. (2004)
[22] DOI: 10.1007/BF01594191 · Zbl 0016.35102
[23] DOI: 10.2307/2118520 · Zbl 0868.57005
[24] Sela Zlil, Publ. Math. Inst. Hautes √Čtudes Sci. 93 pp 31– (2001) · Zbl 1018.20034
[25] DOI: 10.1007/BF02787407 · Zbl 1028.20028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.