Some general algorithms. II: Nilpotent groups
From MaRDI portal
Publication:1150700
DOI10.2307/1971092zbMath0457.20048OpenAlexW2313918999MaRDI QIDQ1150700
Fritz J. Grunewald, Daniel Segal
Publication date: 1980
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1971092
algorithmsarithmetic subgroupalgebraic matrix groupfinite presentations of nilpotent groupsisomorphism problem for nilpotent groups
Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) 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) Classical groups (11E57)
Related Items
The automorphism group of a finitely generated virtually abelian group. ⋮ Undecidability of Module Homomorphisms ⋮ The isomorphism problem for finitely generated fully residually free groups. ⋮ Existence theorems in mathematics ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Equations in Algebras ⋮ A problem of equality for Galois cohomology ⋮ Minimal faithful representations of the free 2-step nilpotent Lie algebra of the rank \(r\) ⋮ Deciding isomorphy using Dehn fillings, the splitting case ⋮ Nilpotent groups of Hirsch length six ⋮ A practical algorithm for finding matrix representations for polycyclic groups ⋮ The isomorphism problem for torsion free nilpotent groups of Hirsch length at most \(5\) ⋮ Algebraic groups ⋮ The isomorphism problem for all hyperbolic groups. ⋮ Linear groups and computation ⋮ Low-complexity computations for nilpotent subgroup problems ⋮ The isomorphism problem for toral relatively hyperbolic groups. ⋮ Rescuing the Whitehead method for free products. II: The algorithm ⋮ Asymptotic invariants, complexity of groups and related problems
