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