×

zbMATH — the first resource for mathematics

Some results on one-relator groups. (English) Zbl 0174.04603

Keywords:
group theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Gilbert Baumslag, Groups with one defining relator, J. Austral. Math. Soc. 4 (1964), 385 – 392. · Zbl 0125.28602
[2] G. Baumslag and K. W. Gruenberg, Some reflections on cohomological dimension and freeness, J. Algebra 6 (1967), 394 – 409. · Zbl 0166.29403
[3] Martin Greendlinger, Dehn’s algorithm for the word problem, Comm. Pure Appl. Math. 13 (1960), 67 – 83. · Zbl 0104.01903
[4] Martin Greendlinger, On Dehn’s algorithms for the conjugacy and word problems, with applications, Comm. Pure Appl. Math. 13 (1960), 641 – 677. · Zbl 0156.01303
[5] Martin Grindlinger, Solution by means of Dehn’s generalized algorithm of the conjugacy problem for a class of groups which coincide with their anti-centers, Dokl. Akad. Nauk SSSR 158 (1964), 1254 – 1256 (Russian).
[6] Roger C. Lyndon, The cohomology theory of group extensions, Duke Math. J. 15 (1948), 271 – 292. · Zbl 0031.19802
[7] Roger C. Lyndon, Cohomology theory of groups with a single defining relation, Ann. of Math. (2) 52 (1950), 650 – 665. · Zbl 0039.02302
[8] Roger C. Lyndon, Dependence and independence in free groups, J. Reine Angew. Math. 210 (1962), 148 – 174. · Zbl 0105.01901
[9] W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, Interscience, New York, 1966. · Zbl 0138.25604
[10] Rimhak Ree and N. S. Mendelsohn, Free subgroups of groups with a single defining relation, Arch. Math. (Basel) 19 (1968), 577 – 580 (1969). · Zbl 0169.33601
[11] V. V. Soldatova, On a class of finitely presented groups, Dokl. Akad. Nauk SSSR 172 (1967), 1276 – 1277 (Russian). · Zbl 0178.01603
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.