Subdirect products of finitely presented metabelian groups
نویسندگان
چکیده
منابع مشابه
Subgroups of Finitely Presented Centre-by-metabelian Groups
1.1. Baumslag's theorem has another facet. It shows that in the variety 2l of metabelian groups, every finitely generated $I-group G occurs as a subgroup of some finitely presented 2I-group G. The analogous result for the variety of all groups is a celebrated theorem of G. Higman [8] which states that a finitely generated group G is the subgroup of a finitely presented group G if, and only if, ...
متن کاملDistortion of Wreath Products in Some Finitely Presented Groups
Wreath products such as Z ≀ Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z ≀ Z as a subgroup of Thompson’s group F and as a subgroup of Baumslag’s metabelian group G. We find that Z ≀ Z is undistorted in F but is at least exponentially distorted in G.
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملThe Algorithmic Theory of Finitely Generated Metabelian Groups
Algorithms are constructed which, when an explicit presentation of a finitely generated metabelian group G in the variety si1 is given, produce unitary presentations for the derived subgroup G', the centre Z{G), the Fitting subgroup Fit(G), and the Frattini subgroup <p(G). Additional algorithms of independent interest are developed for commutative algebra which construct the associated set of p...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2012
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2012.03.036