scholarly journals Genericity, the Arzhantseva-Ol?shanskii method and the isomorphism problem for one-relator groups

2004 ◽  
Vol 331 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Ilya Kapovich ◽  
Paul Schupp
Keyword(s):  
Isomorphism Problem ◽  
One Relator Groups

On the isomorphism problem for one-relator groups

1976 ◽  
Vol 27 (1) ◽  
pp. 484-488 ◽  
Author(s):  
Gerhard Rosenberger ◽  
R. N. Kalia
Keyword(s):  
Isomorphism Problem ◽  
One Relator Groups

The isomorphism problem for a class of one-relator groups

1975 ◽  
Vol 217 (1) ◽  
pp. 53-57 ◽  
Author(s):  
Stephen Meskin
Keyword(s):  
Isomorphism Problem ◽  
One Relator Groups

scholarly journals The isomorphism problem for a class of para-free groups

1997 ◽  
Vol 40 (3) ◽  
pp. 541-549 ◽  
Author(s):  
Benjamin Fine ◽  
Gerhard Rosenberger ◽  
Michael Stille
Keyword(s):  
Group Theory ◽  
Free Group ◽  
Special Interest ◽  
Isomorphism Problem ◽  
Combinatorial Group Theory ◽  
History Of ◽  
One Relator Groups ◽  
Rank 2 ◽  
Combinatorial Group ◽  
Torsion Free

In 1962 Gilbert Baumslag introduced the class of groups Gi, j for natural numbers i, j, defined by the presentations Gi, j = < a, b, t; a−1 = [bi, a] [bj, t] >. This class is of special interest since the groups are para-free, that is they share many properties with the free group F of rank 2.Magnus and Chandler in their History of Combinatorial Group Theory mention the class Gi, j to demonstrate the difficulty of the isomorphism problem for torsion-free one-relator groups. They remark that as of 1980 there was no proof showing that any of the groups Gi, j are non-isomorphic. S. Liriano in 1993 using representations of Gi, j into PSL(2, pk), k ∈ ℕ, showed that G1,1 and G30,30 are non-isomorphic. In this paper we extend these results to prove that the isomorphism problem for Gi, 1, i ∈ ℕ is solvable, that is it can be decided algorithmically in finitely many steps whether or not an arbitrary one-relator group is isomorphic to Gi, 1. Further we show that Gi, 1 ≇ G1, 1 for all i > 1 and if i, k are primes then Gi, 1 ≅ Gk, 1 if and only if i = k.

scholarly journals The isomorphism problem for k-trees is complete for logspace

2012 ◽  
Vol 217 ◽  
pp. 1-11 ◽  
Author(s):  
V. Arvind ◽  
Bireswar Das ◽  
Johannes Köbler ◽  
Sebastian Kuhnert
Keyword(s):  
Isomorphism Problem
Sign in / Sign up

Export Citation Format

Share Document