Derivations and the permutability of subgroups in polycyclic-by-finite groups (Q4547017)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1785266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derivations and the permutability of subgroups in polycyclic-by-finite groups |
scientific article; zbMATH DE number 1785266 |
Statements
Derivations and the permutability of subgroups in polycyclic-by-finite groups (English)
0 references
20 August 2002
0 references
derivations
0 references
permutability of subgroups in groups
0 references
polycyclic-by-finite groups
0 references
decidable properties in groups
0 references
algorithms
0 references
permutable subgroups
0 references
0.8102468252182007
0 references
0.7794747948646545
0 references
0.7718794941902161
0 references
0.7705708742141724
0 references
In recent years an extensive body of algorithms has been developed to perform many standard tasks for polycyclic-by-finite groups (see [\textit{G. Baumslag, F. B. Cannonito, D. J. S. Robinson}, and \textit{D. Segal}, J. Algebra 142, No. 1, 118-149 (1991; Zbl 0774.20019)] and [\textit{D. Segal}, Proc. Lond. Math. Soc., III. Ser. 61, No. 3, 497-528 (1990; Zbl 0674.20020)]). We know that there is an algorithm which is able to decide if a given subgroup \(H\) of a polycyclic-by-finite group \(G\) is permutable, i.e., \(HK=KH\) for each subgroup \(K\) of \(G\) (see 7.7 in [J. Algebra (loc. cit.)]). The paper under review is on the related problem of deciding whether two given subgroups \(H\) and \(K\) permute with each other. The author finds an algorithm for the latter problem as Theorem A: There is an algorithm which, when a polycyclic-by-finite group \(G\) and finite subsets \(X\) and \(Y\) of \(G\) are given, decides if \(HK=KH\) where \(H=\langle X\rangle\) and \(K=\langle Y\rangle\). Theorem A follows from the following theorem which is about derivations. Theorem B: There is an algorithm which, when given a polycyclic-by-finite group \(Q\), a finitely generated Abelian group \(A\) with an explicit \(Q\)-module structure, and a derivation \(\delta\colon Q\to A\), decides if \(\delta\) is surjective. The author concludes this paper with Theorem C where he proves another algorithmic result about derivations which is a consequence of Theorem A. Theorem C: There is an algorithm which, when given a polycyclic-by-finite group \(Q\), a finitely generated Abelian group \(A\) with an explicit \(Q\)-module structure, a derivation \(\delta\colon Q\to A\), and finite subsets \(X,Y\) of \(Q\), decides if \(H^\delta=K^\delta\) where \(H=\langle X\rangle\) and \(K=\langle Y\rangle\). It is proved also that Theorem C implies Theorem A. In the proofs the author extensively uses the algorithms which were already found in [J. Algebra (loc. cit.)] and another ingredient is the use of induction on the Hirsch length of the underlying group. The author mentions that the main problem of this paper which is solved in Theorem A is mentioned in an earlier paper of \textit{J. C. Lennox} and \textit{J. S. Wilson} (Corollary A1 of [Arch. Math. 28, 113-116 (1977; Zbl 0368.20018)]) and there, it is stated that the problem has a positive solution as a consequence of the fact that two subgroups of a polycyclic-by-finite group permute if their images in every finite quotient permute. He continues that the connection between these results is not clear and it seems probable that the statement was an oversight and Theorem A is to remedy the situation.
0 references