Recognition of finite matrix groups over infinite fields

Alla Detinko, Dane Flannery, Eamonn O'Brien

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)100–109
Number of pages10
JournalJournal of Symbolic Computation,
Volume50
Early online date14 Jun 2012
DOIs
Publication statusPublished - 1 Mar 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'Recognition of finite matrix groups over infinite fields'. Together they form a unique fingerprint.

Cite this