Some general algorithms. II: Nilpotent groups

DOI10.2307/1971092MaRDI QIDQ1150700zbMATH OpenOpenAlexFDO

Authors Fritz Grunewald, Dan 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

zbMATH Keywords

algebraic matrix groupalgorithmsarithmetic subgroupfinite presentations of nilpotent groupsisomorphism problem for nilpotent groups

Mathematics Subject Classification ID

Classical groups (11E57) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18) Linear algebraic groups over the reals, the complexes, the quaternions (20G20)

Cited in

(22)

• The isomorphism problem for toral relatively hyperbolic groups.
• Existence theorems in mathematics
• A problem of equality for Galois cohomology
• Nilpotent groups of Hirsch length six
• Deciding isomorphy using Dehn fillings, the splitting case
• A practical algorithm for finding matrix representations for polycyclic groups
• Minimal faithful representations of the free 2-step nilpotent Lie algebra of the rank r
• Linear groups and computation
• Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
• The automorphism group of a finitely generated virtually abelian group.
• Undecidability of Module Homomorphisms
• Asymptotic invariants, complexity of groups and related problems.
• Equations in algebras
• Low-complexity computations for nilpotent subgroup problems
• Logspace and compressed-word computations in nilpotent groups
• The isomorphism problem for torsion free nilpotent groups of Hirsch length at most \(5\)
• The isomorphism problem for all hyperbolic groups.
• Algebraic groups
• On isomorphisms to a free group and beyond
• Semigroup intersection problems in the Heisenberg groups
• Rescuing the Whitehead method for free products. II: The algorithm
• The isomorphism problem for finitely generated fully residually free groups.

This page was built for publication: Some general algorithms. II: Nilpotent groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150700)