Conjugacy in polycyclic groups
From MaRDI portal
Publication:4187979
Cites work
Cited in
(9)- Algorithmic problems in Engel groups and cryptographic applications
- Conjugacy separability and separable orbits
- Closed orbits and finite approximability with respect to conjugacy of free amalgamated products
- Subgroup conjugacy separability of free-by-finite groups.
- The algorithmic theory of polycyclic-by-finite groups
- On double coset separability and the Wilson–Zalesskii property
- Multiple conjugacy problem in graphs of free abelian groups.
- On products of subgroups in polycyclic groups
- Finite subgroups of the profinite completion of good groups
This page was built for publication: Conjugacy in polycyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187979)