The automorphism group of a finitely generated virtually abelian group.
DOI10.1515/GCC-2016-0007zbMATH Open1346.20047OpenAlexW2330763273MaRDI QIDQ285908FDOQ285908
Authors: B. Eick
Publication date: 19 May 2016
Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/gcc-2016-0007
Recommendations
Automorphisms of infinite groups (20E36) Generators, relations, and presentations of groups (20F05) Automorphism groups of groups (20F28) Solvable groups, supersolvable groups (20F16) Other classes of groups defined by subgroup chains (20F22) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- Title not available (Why is that?)
- Some general algorithms. I: Arithmetic groups
- Some general algorithms. II: Nilpotent groups
- Automorphism group computation and isomorphism testing in finite groups
- Constructing arithmetic subgroups of unipotent groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- The automorphism group of a polycyclic group
- Free subgroups in linear groups
- Dual Cones and the Voronoi Algorithm
- On certain classes of infinite solvable groups
- Testing polycyclicity of finitely generated rational matrix groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Title not available (Why is that?)
- Automorphisms of the two dimensional crystallographic groups.
- On the Fitting subgroup of a polycyclic-by-finite group and its applications
- Algorithms for the Tits alternative and related problems.
Cited In (3)
Uses Software
This page was built for publication: The automorphism group of a finitely generated virtually abelian group.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285908)