Peer-Reviewed Journal Details
Mandatory Fields
Detinko, AS,Flannery, DL,O'Brien, EA
Journal Of Symbolic Computation
Recognizing finite matrix groups over infinite fields
Optional Fields
Finitely generated linear group Finite linear group Decision problem Algorithm DECIDING FINITENESS ALGORITHMS SUBGROUPS
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. (C) 2012 Elsevier B.V. All rights reserved.
DOI 10.1016/j.jsc.2012.04.002
Grant Details
Publication Themes