The automorphism group of a finitely generated virtually abelian group.
From MaRDI portal
Publication:285908
DOI10.1515/gcc-2016-0007zbMath1346.20047OpenAlexW2330763273MaRDI QIDQ285908
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
Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Other classes of groups defined by subgroup chains (20F22) Automorphisms of infinite groups (20E36) Automorphism groups of groups (20F28) Software, source code, etc. for problems pertaining to group theory (20-04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the Tits alternative and related problems.
- 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
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Automorphisms of the Two Dimensional Crystallographic Groups
- On the Fitting subgroup of a polycyclic-by-finite group and its applications
This page was built for publication: The automorphism group of a finitely generated virtually abelian group.