Algorithms for linear groups of finite rank.

DOI10.1016/j.jalgebra.2013.06.006zbMath1287.20056arXiv1905.04546MaRDI QIDQ2438392

E. A. O'Brien, Alla S. Detinko, Dane L. Flannery

Publication date: 11 March 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.04546

zbMATH Keywords

algorithms; subgroups of finite index; solvable-by-finite groups; torsion-free rank; Prüfer rank; linear groups of finite rank

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20G15: Linear algebraic groups over arbitrary fields

20E07: Subgroup theorems; subgroup growth

20F05: Generators, relations, and presentations of groups

20F19: Generalizations of solvable and nilpotent groups

20-04: Software, source code, etc. for problems pertaining to group theory

Related Items

Algorithms for arithmetic groups with the congruence subgroup property., Integrality and arithmeticity of solvable linear groups., Homological dimension of elementary amenable groups, Linear groups and computation

Uses Software

• Magma

Cites Work

• Algorithms for the Tits alternative and related problems.
• The Magma algebra system. I: The user language
• Recognizing finite matrix groups over infinite fields.
• Constructing arithmetic subgroups of unipotent groups.
• Computing polycyclic presentations for polycyclic rational matrix groups.
• The Orbit-Stabilizer Problem for Linear Groups
• Finite rational matrix groups
• Generating Finite Completely Reducible Linear Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item