651 research outputs found
Stallings graphs for quasi-convex subgroups
We show that one can define and effectively compute Stallings graphs for
quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or
right-angled Artin groups). These Stallings graphs are finite labeled graphs,
which are canonically associated with the corresponding subgroups. We show that
this notion of Stallings graphs allows a unified approach to many algorithmic
problems: some which had already been solved like the generalized membership
problem or the computation of a quasi-convexity constant (Kapovich, 1996); and
others such as the computation of intersections, the conjugacy or the almost
malnormality problems.
Our results extend earlier algorithmic results for the more restricted class
of virtually free groups. We also extend our construction to relatively
quasi-convex subgroups of relatively hyperbolic groups, under certain
additional conditions.Comment: 40 pages. New and improved versio
The isomorphism problem for all hyperbolic groups
We give a solution to Dehn's isomorphism problem for the class of all
hyperbolic groups, possibly with torsion. We also prove a relative version for
groups with peripheral structures. As a corollary, we give a uniform solution
to Whitehead's problem asking whether two tuples of elements of a hyperbolic
group are in the same orbit under the action of \Aut(G). We also get an
algorithm computing a generating set of the group of automorphisms of a
hyperbolic group preserving a peripheral structure.Comment: 71 pages, 4 figure
The Grushko decomposition of a finite graph of finite rank free groups: an algorithm
A finitely generated group admits a decomposition, called its Grushko
decomposition, into a free product of freely indecomposable groups. There is an
algorithm to construct the Grushko decomposition of a finite graph of finite
rank free groups. In particular, it is possible to decide if such a group is
free.Comment: Published by Geometry and Topology at
http://www.maths.warwick.ac.uk/gt/GTVol9/paper41.abs.htm
On the finite presentation of subdirect products and the nature of residually free groups
We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion
for the finite presentability of subdirect products of groups: if
are finitely presented and
projects to a subgroup of finite index in
each , then is finitely presentable, indeed there
is an algorithm that will construct a finite presentation for .
We use the VSP criterion to characterise the finitely presented residually
free groups. We prove that the class of such groups is recursively enumerable.
We describe an algorithm that, given a finite presentation of a residually free
group, constructs a canonical embedding into a direct product of finitely many
limit groups. We solve the (multiple) conjugacy problem and membership problem
for finitely presentable subgroups of residually free groups. We also prove
that there is an algorithm that, given a finite generating set for such a
subgroup, will construct a finite presentation.
New families of subdirect products of free groups are constructed, including
the first examples of finitely presented subgroups that are neither
nor of Stallings-Bieri typeComment: 44 pages. To appear in American Journal of Mathematics. This is a
substantial rewrite of our previous Arxiv article 0809.3704, taking into
account subsequent developments, advice of colleagues and referee's comment
- …