Projects per year
Abstract
In this paper we present an O(d4 log(log d) log q + d3m) Las Vegas algorithm for find- ing a nontrivial reduction of groups that are irreducible with m generators and either lie in the subfield class of matrix or projective groups or are semilinear or have non-absolutely irreducible derived group. We also characterise the absolutely irreducible groups G over arbitrary fields whose derived group consists only of scalars, and prove probabilistic gener- ation results about matrix groups.
Original language | English |
---|---|
Pages (from-to) | 613-637 |
Journal | Journal of Algebra |
Volume | 322 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2009 |
Fingerprint
Dive into the research topics of 'A polynomial-time reduction algorithm for groups of semilinear or subfield class'. Together they form a unique fingerprint.Projects
- 1 Finished
-
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