Projects per year
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 language | English |
---|---|
Pages (from-to) | 371-384 |
Journal | Journal of Symbolic Computation |
Volume | 46 |
Issue number | 4 |
Early online date | 17 Sept 2010 |
DOIs | |
Publication status | Published - Apr 2011 |
Fingerprint
Dive into the research topics of 'Constructive homomorphisms for classical groups'. Together they form a unique fingerprint.Projects
- 2 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Ruskuc, N. (PI) & Quick, M. (CoI)
1/09/05 → 31/08/10
Project: Standard
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard