The algorithmic theory of polycyclic-by-finite groups
DOI10.1016/0021-8693(91)90221-SzbMath0774.20019MaRDI QIDQ1178862
Derek J. S. Robinson, Frank B. Cannonito, Daniel Segal, Gilbert Baumslag
Publication date: 26 June 1992
Published in: Journal of Algebra (Search for Journal in Brave)
wordsalgorithmspolycyclic-by-finite groupsgeneratorsgeneralized word problemconjugacy problemsubgroup of finite indexfinite presentationGL(n,Z)
Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Generalizations of solvable and nilpotent groups (20F19) Linear algebraic groups over the reals, the complexes, the quaternions (20G20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Überauflösbare Gruppen
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
- On products of subgroups in polycyclic groups
- Some recognizable properties of solvable groups
- Computable algebra and group embeddings
- Conjugacy in polycyclic groups
- Infinitely generated subgroups of finitely presented groups. I
- Conjugate separability in polycyclic groups
- Über den Normalisator von subnormalen und erreichbaren Untergruppen
- On a problem of Philip Hall
- Cohomological topics in group theory.
- Permutable subgroups of infinite groups
- A Note on Quasinormal Subgroups of Finitely Generated Groups
- Constructions in a Polynomial Ring Over the Ring of Integers
- Decidable Properties of Polycyclic Groups
- Conjugacy in polycyclic groups
- Shorter Notes: Representations of Polycyclic Groups
- A Minimality Property of Polycyclic Groups
- On Infinite Soluble Groups-I
- On Infinite Soluble Groups (IV)
- On Infinite Soluble Groups (V)
- On Infinite Soluble Groups (III)