Algorithms for linear groups of finite rank.

DOI10.1016/j.jalgebra.2013.06.006zbMath1287.20056arXiv1905.04546OpenAlexW2068813692MaRDI 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

algorithmssubgroups of finite indexsolvable-by-finite groupstorsion-free rankPrüfer ranklinear groups of finite rank

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over arbitrary fields (20G15) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Generalizations of solvable and nilpotent groups (20F19) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

A note on skew linear groups of finite rank ⋮ Homological dimension of elementary amenable groups ⋮ Algorithms for arithmetic groups with the congruence subgroup property. ⋮ Integrality and arithmeticity of solvable linear groups. ⋮ On the residual and profinite closures of commensurated subgroups ⋮ Linear groups and computation

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Algorithms for linear groups of finite rank.