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 commentsInternational audienceWe establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presentability of subdirect products of groups: if $\Gamma_1,...,\Gamma_n$ are finitely presented and $S<\Gamma_1\times...\times\Gamma_n$ projects to a subgroup of finite index in each $\Gamma_i\times\Gamma_j$, then $S$ is finitely presentable, indeed there is an algorithm that will construct a finite presentation for $S$. 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 ${\rm{FP}}_\infty$ nor of Stallings-Bieri typ
If 1 ; : : : ; n are limit groups and S 1 n is of type FP n /ޑ. then S contains a subgroup of finite index that is itself a direct product of at most n limit groups. This answers a question of Sela.
Abstract. We give a criterion for fibre products to be finitely presented and use it as the basis of a construction that encodes the pathologies of finite group presentations into pairs of groups P ⊂ G where G is a product of hyperbolic groups and P is a finitely presented subgroup. This enables us to prove that there is a finitely presented subgroup P in a biautomatic group G such that the generalized word problem for P ⊂ G is unsolvable and P has an unsolvable conjugacy problem. An additional construction shows that there exists a compact non-positively curved polyhedron X such that π 1 X is biautomatic and there is no algorithm to decide isomorphism among the finitely presented subgroups of π 1 X.
Abstract. We investigate the structure of subdirect products of groups, particularly their finiteness properties. We pay special attention to the subdirect products of free groups, surface groups and HNN extensions. We prove that a finitely presented subdirect product of free and surface groups virtually contains a term of the lower central series of the direct product or else fails to intersect one of the direct summands. This leads to a characterization of the finitely presented subgroups of the direct product of 3 free or surface groups, and to a solution to the conjugacy problem for arbitrary finitely presented subgroups of direct products of surface groups. We obtain a formula for the first homology of a subdirect product of two free groups and use it to show there is no algorithm to determine the first homology of a finitely generated subgroup.
Abstract. We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automatic. We can also arrange that such subgroups satisfy, at best, an exponential isoperimetric inequality.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.