The automorphism group of a finitely generated virtually abelian group. (Q285908): Difference between revisions

It is well-known that the automorphism group of an arbitrary polycyclic group is finitely generated, and one of the main problems in the algorithmic theory of polycyclic groups is the construction of a practical method producing the generators of the automorphism group. In the paper under review the author considers the special case of a finitely generated group containing an abelian subgroup of finite index, and describes a practical method to determine the automorphisms of such a group.

0 references

zbMATH Keywords

generators of automorphism groups

0 references

polycyclic groups

0 references

Abelian-by-finite groups

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1515/gcc-2016-0007

0 references

cites work

Computing polycyclic presentations for polycyclic rational matrix groups.

0 references

Testing polycyclicity of finitely generated rational matrix groups

0 references

The automorphism group of a polycyclic group

0 references

Q4161848

0 references

Automorphism group computation and isomorphism testing in finite groups

0 references

Constructing arithmetic subgroups of unipotent groups.

0 references

Algorithms for the Tits alternative and related problems.

0 references

On the Fitting subgroup of a polycyclic-by-finite group and its applications

0 references

CONSTRUCTING AUTOMORPHISM GROUPS OF <i>p</i>-GROUPS

0 references

Automorphisms of the Two Dimensional Crystallographic Groups

0 references

Some general algorithms. I: Arithmetic groups

0 references

Some general algorithms. II: Nilpotent groups

0 references

Q4650358

0 references

On certain classes of infinite solvable groups

0 references

Q4843626

0 references

Dual Cones and the Voronoi Algorithm

0 references

Q3961021

0 references

Free subgroups in linear groups

0 references

Identifiers

zbMATH Open document ID

1346.20047

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1515/GCC-2016-0007

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:285908

@@ Property / DOI @@
-.1515/gcc-2016-0007
@@ Property / DOI: 10.1515/gcc-2016-0007 / rank @@
-Normal rank
@@ Property / review text @@
+It is well-known that the automorphism group of an arbitrary polycyclic group is finitely generated, and one of the main problems in the algorithmic theory of polycyclic groups is the construction of a practical method producing the generators of the automorphism group. In the paper under review the author considers the special case of a finitely generated group containing an abelian subgroup of finite index, and describes a practical method to determine the automorphisms of such a group.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F28
@@ Property / Mathematics Subject Classification ID: 20F28 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+E36
@@ Property / Mathematics Subject Classification ID: 20E36 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F16
@@ Property / Mathematics Subject Classification ID: 20F16 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+-04
@@ Property / Mathematics Subject Classification ID: 20-04 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F05
@@ Property / Mathematics Subject Classification ID: 20F05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F22
@@ Property / Mathematics Subject Classification ID: 20F22 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6582785
@@ Property / zbMATH DE Number: 6582785 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+generators of automorphism groups
@@ Property / zbMATH Keywords: generators of automorphism groups / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polycyclic groups
@@ Property / zbMATH Keywords: polycyclic groups / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Abelian-by-finite groups
@@ Property / zbMATH Keywords: Abelian-by-finite groups / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GAP
@@ Property / describes a project that uses: GAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Cryst
@@ Property / describes a project that uses: Cryst / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CrystGAP
@@ Property / describes a project that uses: CrystGAP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/gcc-2016-0007
+Normal rank
@@ Property / OpenAlex ID @@
+W2330763273
@@ Property / OpenAlex ID: W2330763273 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing polycyclic presentations for polycyclic rational matrix groups.
+Normal rank
@@ Property / cites work @@
+Testing polycyclicity of  finitely generated rational matrix groups
+Normal rank
@@ Property / cites work @@
+The automorphism group of a polycyclic group
@@ Property / cites work: The automorphism group of a polycyclic group / rank @@
+Normal rank
@@ Property / cites work @@
+Q4161848
@@ Property / cites work: Q4161848 / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphism group computation and isomorphism testing in finite groups
+Normal rank
@@ Property / cites work @@
+Constructing arithmetic subgroups of unipotent groups.
+Normal rank
@@ Property / cites work @@
+Algorithms for the Tits alternative and related problems.
+Normal rank
@@ Property / cites work @@
+On the Fitting subgroup of a polycyclic-by-finite group and its applications
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING AUTOMORPHISM GROUPS OF <i>p</i>-GROUPS
+Normal rank
@@ Property / cites work @@
+Automorphisms of the Two Dimensional Crystallographic Groups
+Normal rank
@@ Property / cites work @@
+Some general algorithms. I: Arithmetic groups
@@ Property / cites work: Some general algorithms. I: Arithmetic groups / rank @@
+Normal rank
@@ Property / cites work @@
+Some general algorithms. II: Nilpotent groups
@@ Property / cites work: Some general algorithms. II: Nilpotent groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4650358
@@ Property / cites work: Q4650358 / rank @@
+Normal rank
@@ Property / cites work @@
+On certain classes of infinite solvable groups
@@ Property / cites work: On certain classes of infinite solvable groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4843626
@@ Property / cites work: Q4843626 / rank @@
+Normal rank
@@ Property / cites work @@
+Dual Cones and the Voronoi Algorithm
@@ Property / cites work: Dual Cones and the Voronoi Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q3961021
@@ Property / cites work: Q3961021 / rank @@
+Normal rank
@@ Property / cites work @@
+Free subgroups in linear groups
@@ Property / cites work: Free subgroups in linear groups / rank @@
+Normal rank
@@ Property / DOI @@
+.1515/GCC-2016-0007
@@ Property / DOI: 10.1515/GCC-2016-0007 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:285908