The algorithmic theory of polycyclic-by-finite groups☆

A group is said to be polycyclic-by-finite, or a PF-group for short, if it has a polycyclic normal subgroup of finite index. Equivalently, PF-groups are exactly the groups which have a series of finite length whose infinite factors are cyclic. By a well-known theorem of P. Hall every PF-group is finitely presented-and in fact PF-groups form the largest known sectionclosed class of finitely presented groups. It is this fact that makes PF-groups natural objects of study from the algorithmic standpoint. The general aim of the algorithmic theory of PF-groups can be described as the collection of information about a PF-group which can, in principle

[1]  O. Kegel Über den Normalisator von subnormalen und erreichbaren Untergruppen , 1966 .

[2]  Frank B. Cannonito,et al.  Some recognizable properties of solvable groups , 1981 .

[3]  K. Hirsch On Infinite Soluble Groups (III) , 1938 .

[4]  J. Lennox A Note on Quasinormal Subgroups of Finitely Generated Groups , 1981 .

[5]  F. Grunewald,et al.  Conjugacy in polycyclic groups , 1978 .

[6]  F. Grunewald Solution of the Conjugacy Problem in Certain Arithmetic Groups , 1980 .

[7]  Frank B. Cannonito,et al.  Infinitely generated subgroups of finitely presented groups. Part II , 1977 .

[8]  A. Seidenberg CONSTRUCTIONS IN A POLYNOMIAL RING OVER THE RING OF INTEGERS. , 1978 .

[9]  John C. Lennox,et al.  On products of subgroups in polycyclic groups , 1979 .

[10]  Richard G. Swan,et al.  Representations of polycyclic groups , 1967 .

[11]  W. Magnus,et al.  Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .

[12]  Frank B. Cannonito,et al.  Computable algebra and group embeddings , 1981 .

[13]  Louis Auslander,et al.  On a Problem of Philip Hall , 1967 .

[14]  E. Formanek Conjugate separability in polycyclic groups , 1976 .

[15]  K. Gruenberg,et al.  Cohomological topics in group theory , 1970 .

[16]  Gilbert Baumslag,et al.  Algorithmically insoluble problems about finitely presented solvable groups, lie, and associative algebras , 1985 .

[17]  S. Stonehewer Permutable subgroups of infinite groups , 1972 .

[18]  V. Remeslennikov An algorithmic problem for nilpotent groups and rings , 1979 .

[19]  K. Hirsch On Infinite Soluble Groups (IV) , 1952 .

[20]  R. Bieri,et al.  Homological dimension of discrete groups , 1981 .

[21]  D. Segal Decidable Properties of Polycyclic Groups , 1990 .

[22]  Gilbert Baumslag,et al.  Algorithmically insoluble problems about finitely presented solvable groups, lie and associative algebras. I , 1986 .

[23]  C. Curtis,et al.  Representation theory of finite groups and associated algebras , 1962 .