Constructive homomorphisms for classical groups

Scott H Murray, Colva Mary Roney-Dougal

Research output: Contribution to journalArticlepeer-review

Abstract

Let Ω ≤ GL(V ) be a quasisimple classical group in its natural representation over a finite vector space V , and let ∆ = NGL(V )(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, polynomial-time algorithms for computing the image of an element. Given a discrete logarithm oracle, we also represent ∆/Ω as a group with at most 3 generators and 6 relations. We then compute canonical representatives for the cosets of Ω. A key ingredient of our algorithms is a new, asymptotically fast method for constructing isometries between spaces with forms. Our results are useful for the matrix group recognition project, can be used to solve element conjugacy problems, and can improve algorithms to construct maximal subgroups.
Original languageEnglish
Pages (from-to)371-384
JournalJournal of Symbolic Computation
Volume46
Issue number4
Early online date17 Sept 2010
DOIs
Publication statusPublished - Apr 2011

Fingerprint

Dive into the research topics of 'Constructive homomorphisms for classical groups'. Together they form a unique fingerprint.

Cite this