AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (or F-groups for short) is decidable. We also show that each F-group G has a decomposition that is invariant under automorphisms of G, and obtain a structure theorem for the group of outer automorphisms Out(G)
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
We show that Out(G) is residually finite if G is one-ended and hyperbolic relative to virtually poly...
We present an algorithm for the following problem: given a context-free grammar for the word problem...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
Abstract. We prove that the isomorphism problem for finitely gen-erated fully residually free groups...
AbstractConfirming a conjecture of G. Hjorth and A. Kechris (1996, Ann. Pure Appl. Logic82, 221–272)...
Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residu...
AbstractWe show that every countable group Q is isomorphic to Out(N) where N is a finitely generated...
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoin...
Bumagin–Wise posed the question of whether every countable group can be realised as the outer automo...
We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We pr...
AbstractWe show that certain properties of groups of automorphisms can be read off from the actions ...
Abstract. We consider finitely presented, residually finite groups G and finitely generated nor-mal ...
Gruppen kann man durch Präsentationen darstellen. Die Frage, ob zwei Präsentationen isomorphe Gruppe...
40 pages, 3 figuresInternational audienceGiven a group $G$ splitting as a free product $G=G_1\ast\do...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
We show that Out(G) is residually finite if G is one-ended and hyperbolic relative to virtually poly...
We present an algorithm for the following problem: given a context-free grammar for the word problem...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
Abstract. We prove that the isomorphism problem for finitely gen-erated fully residually free groups...
AbstractConfirming a conjecture of G. Hjorth and A. Kechris (1996, Ann. Pure Appl. Logic82, 221–272)...
Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residu...
AbstractWe show that every countable group Q is isomorphic to Out(N) where N is a finitely generated...
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoin...
Bumagin–Wise posed the question of whether every countable group can be realised as the outer automo...
We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We pr...
AbstractWe show that certain properties of groups of automorphisms can be read off from the actions ...
Abstract. We consider finitely presented, residually finite groups G and finitely generated nor-mal ...
Gruppen kann man durch Präsentationen darstellen. Die Frage, ob zwei Präsentationen isomorphe Gruppe...
40 pages, 3 figuresInternational audienceGiven a group $G$ splitting as a free product $G=G_1\ast\do...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
We show that Out(G) is residually finite if G is one-ended and hyperbolic relative to virtually poly...
We present an algorithm for the following problem: given a context-free grammar for the word problem...