Recognizing finite matrix groups over infinite fields.
From MaRDI portal
Publication:1930160
DOI10.1016/j.jsc.2012.04.002zbMath1268.20055arXiv1905.04704MaRDI QIDQ1930160
E. A. O'Brien, Alla S. Detinko, Dane L. Flannery
Publication date: 10 January 2013
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.04704
algorithms; decision problems; finite linear groups; finitely generated linear groups; finiteness problem
68W30: Symbolic computation and algebraic computation
20-04: Software, source code, etc. for problems pertaining to group theory
20H20: Other matrix groups over fields
Related Items
Zariski density and computing in arithmetic groups, Algorithms for arithmetic groups with the congruence subgroup property., A practical model for computation with matrix groups., Integrality and arithmeticity of solvable linear groups., The use of permutation representations in structural computations in large finite matrix groups, Linear groups and computation, Algorithms for linear groups of finite rank.
Uses Software