Hostname: page-component-7d684dbfc8-csfzr Total loading time: 0 Render date: 2023-09-23T07:22:04.373Z Has data issue: false Feature Flags: { "corePageComponentGetUserInfoFromSharedSession": true, "coreDisableEcommerce": false, "coreDisableSocialShare": false, "coreDisableEcommerceForArticlePurchase": false, "coreDisableEcommerceForBookPurchase": false, "coreDisableEcommerceForElementPurchase": false, "coreUseNewShare": true, "useRatesEcommerce": true } hasContentIssue false


Published online by Cambridge University Press:  01 October 2008

School of Mathematics, University of Birmingham, Birmingham B15 2TT, UK (email:
Department of Mathematics, University of Auckland, Auckland, New Zealand (email:
Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA (email:
For correspondence; e-mail:
Rights & Permissions [Opens in a new window]


Core share and HTML view are not possible as this article does not have html content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let G be isomorphic to a group H satisfying SL(d,q)≤H≤GL(d,q) and let W be an irreducible FqG-module of dimension at most d2. We present a Las Vegas polynomial-time algorithm which takes as input W and constructs a d-dimensional projective representation of G.

Research Article
Copyright © 2008 Australian Mathematical Society


This work was supported in part by the NSA, the Marsden Fund of New Zealand, and the NSF.


[1]Babai, László, ‘Local expansion of vertex-transitive graphs and random generation in finite groups’, in: Theory of Computing, Los Angeles, 1991 (Association for Computing Machinery, New York, 1991), pp. 164174.Google Scholar
[2]Beals, Robert, Leedham-Green, Charles R., Niemeyer, Alice C., Praeger, Cheryl E. and Seress, Ákos, ‘A black-box group algorithm for recognizing finite symmetric and alternating groups I’, Trans. Amer. Math. Soc. 355 (2003), 20972113.CrossRefGoogle Scholar
[3]Beals, Robert, Leedham-Green, Charles R., Niemeyer, Alice C., Praeger, Cheryl E. and Seress, Ákos, ‘Constructive recognition of finite symmetric and alternating groups acting as matrix groups on their natural permutation modules’, J. Algebra 292 (2005), 446.CrossRefGoogle Scholar
[4]Bosma, Wieb, Cannon, John and Playoust, Catherine, ‘The Magma algebra system I: the user language’, J. Symbolic Comput. 24 (1997), 235265.CrossRefGoogle Scholar
[5]Brooksbank, Peter A., ‘Constructive recognition of classical groups in their natural representation’, J. Symbolic Comput. 35 (2003), 195239.CrossRefGoogle Scholar
[6]Celler, Frank, Leedham-Green, Charles R., Murray, Scott H., Niemeyer, Alice C. and O’Brien, E. A., ‘Generating random elements of a finite group’, Comm. Algebra 23 (1995), 49314948.CrossRefGoogle Scholar
[7] The Group. — Groups, Algorithms, and Programming. Version 4.4.9; 2007, ( Scholar
[8]Glasby, S. P., Leedham-Green, C. R. and O’Brien, E. A., ‘Writing projective representations over subfields’, J. Algebra 295 (2006), 5161.CrossRefGoogle Scholar
[9]Kantor, William M. and Seress, Ákos, ‘Black box classical groups’, Mem. Amer. Math. Soc. 149 (2001).Google Scholar
[10]Keller-Gehrig, W., ‘Fast algorithms for the characteristic polynomial’, Theoret. Comput. Sci. 36 (1985), 309317.CrossRefGoogle Scholar
[11]Leedham-Green, C. R. and O’Brien, E. A., Constructive recognition of classical groups in odd characteristic. Preprint 2007.Google Scholar
[12]Liebeck, Martin W., ‘On the orders of maximal subgroups of the finite classical groups’, Proc. London Math. Soc. (3) 50 (1985), 426446.CrossRefGoogle Scholar
[13]Nathanson, M. B., Elementary Methods in Number Theory (Springer, New York, 2000).Google Scholar
[14]Neumann, P. M. and Praeger, C. E., ‘A recognition algorithm for special linear groups’, Proc. London Math. Soc. 65 (1992), 555603.CrossRefGoogle Scholar
[15]O’Brien, E. A., ‘Towards effective algorithms for linear groups’, in: Finite Geometries, Groups and Computation, (Pingree Park, Co, 2004) (De Gruyter, Berlin, 2006), pp. 163190.Google Scholar
[16]Pak, Igor, ‘The product replacement algorithm is polynomial’, in: 41st Ann. Symp. on Foundations of Computer Science, (Redondo Beach, CA, 2000) (IEEE Computer Society Press, Los Alamitos, CA, 2000), pp. 476485.Google Scholar
[17]Ryba, Alexander J. E., ‘Identification of matrix generators of a Chevalley group’, J. Algebra 309 (2007), 484496.CrossRefGoogle Scholar
[18]Seress, Ákos, Permutation Group Algorithms, Cambridge Tracts in Mathematics, 152 (Cambridge University Press, Cambridge, 2003).CrossRefGoogle Scholar
[19]Gathen, Joachim von zur and Gerhard, Jürgen, Modern Computer Algebra (Cambridge University Press, Cambridge, 2002).Google Scholar