The Conjugacy Problem in Wreath Products and Free Metabelian Groups
From MaRDI portal
Publication:5510826
DOI10.2307/1994482zbMath0136.27602OpenAlexW4248769651MaRDI QIDQ5510826
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/1994482
Related Items (13)
The conjugacy problem for centre-by-metabelian groups ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ Conjugacy in free polynilpotent groups ⋮ Algorithmic theory of free solvable groups: randomized computations. ⋮ The braided Ptolemy-Thompson group is finitely presented. ⋮ The word and geodesic problems in free solvable groups ⋮ Spherical quadratic equations in free metabelian groups ⋮ On the word problem and the conjugacy problem for groups of the form \(F/V(R)\) ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ Some properties of a Magnus embedding ⋮ General theory of groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}
Cites Work
This page was built for publication: The Conjugacy Problem in Wreath Products and Free Metabelian Groups