On trifactorized soluble groups of finite rank (Q755891)

From MaRDI portal





scientific article; zbMATH DE number 4190022
Language Label Description Also known as
default for all languages
No label defined
    English
    On trifactorized soluble groups of finite rank
    scientific article; zbMATH DE number 4190022

      Statements

      On trifactorized soluble groups of finite rank (English)
      0 references
      0 references
      0 references
      1991
      0 references
      Let the soluble-by-finite group \(G=AB=AC=BC\) with finite abelian section rank be the product of two nilpotent subgroups A and B and a subgroup C. It is shown that, if C is hypercentral (hypercyclic), then G is hypercentral (hypercyclic); if, in addition, G has only elements of finitely many different prime orders and C is nilpotent, then G is nilpotent. This generalizes a well-known result of O. H. Kegel for finite groups which was later extended to soluble minimax groups by the authors and the reviewer. Note that there exist examples of groups \(G=AB=AC=BC\) with finite Prüfer rank where A, B, C are abelian and C is normal in G, but G is not nilpotent. - The proofs of the above results depend on splitting and conjugacy theorems obtained by means from the cohomology theory of groups. First it is proved that a soluble-by-finite group with finite abelian section rank, which is trifactorized by three FC-nilpotent subgroups, is likewise FC-nilpotent.
      0 references
      products of groups
      0 references
      factorized groups
      0 references
      soluble-by-finite group
      0 references
      finite abelian section rank
      0 references
      nilpotent subgroups
      0 references
      hypercentral
      0 references
      hypercyclic
      0 references
      soluble minimax groups
      0 references
      finite Prüfer rank
      0 references
      trifactorized
      0 references
      FC-nilpotent subgroups
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references