Recognizing finite matrix groups over infinite fields.
From MaRDI portal
Publication:1930160
DOI10.1016/j.jsc.2012.04.002zbMath1268.20055arXiv1905.04704OpenAlexW2017895203MaRDI 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
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over fields (20H20)
Related Items
Zariski density and computing in arithmetic groups ⋮ Algorithms for linear groups of finite rank. ⋮ Algorithms for arithmetic groups with the congruence subgroup property. ⋮ A practical model for computation with matrix groups. ⋮ Integrality and arithmeticity of solvable linear groups. ⋮ A note on group representations, determinantal hypersurfaces and their quantizations ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ Linear groups and computation ⋮ On the geometry of symmetry breaking inequalities ⋮ Algorithms for Experimenting with Zariski Dense Subgroups ⋮ Classifying finite monomial linear groups of prime degree in characteristic zero
Uses Software
This page was built for publication: Recognizing finite matrix groups over infinite fields.