Recognizing finite matrix groups over infinite fields
Preprint
Abstract
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm that, given such a finite group as input, in practice successfully constructs an isomorphic copy over a finite field, and uses this copy to investigate the group's structure. Implementations of our algorithms are available in MAGMA.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- A practical model for computation with matrix groupsJournal of Symbolic Computation, 2015
- Recognizing finite matrix groups over infinite fieldsJournal of Symbolic Computation, 2013
- Algorithms for the Tits alternative and related problemsJournal of Algebra, 2011
- Algorithms for matrix groups2011
- Deciding finiteness of matrix groups in positive characteristicJournal of Algebra, 2009
- On deciding finiteness of matrix groupsJournal of Symbolic Computation, 2009
- Algorithms for computing with nilpotent matrix groups over infinite domainsJournal of Symbolic Computation, 2008
- Deciding finiteness for matrix semigroups over function fields over finite fieldsIsrael Journal of Mathematics, 2001
- Deciding finiteness for matrix groups over function fieldsIsrael Journal of Mathematics, 1999
- Some remarks on sylow subgroups of general linear groupsMathematische Zeitschrift, 1986