Skip Navigation


Journal of the London Mathematical Society Advance Access originally published online on July 27, 2007
Journal of the London Mathematical Society 2007 75(3):741-754; doi:10.1112/jlms/jdm028
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
75/3/741    most recent
jdm028v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Liebeck, M. W.
Right arrow Articles by O'Brien, E. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 London Mathematical Society

Finding the characteristic of a group of Lie type

Martin W. Liebeck1 and E. A. O'Brien2

1 Department of Mathematics
Imperial College
London SW7 2BZ
United Kingdom
2 Department of Mathematics
University of Auckland
Private Bag 92019
Auckland 1142
New Zealand

We present a black-box polynomial-time Monte Carlo algorithm which, given as input a quasi-simple group of Lie type, finds its characteristic.

m.liebeck{at}imperial.ac.uk

2000 Mathematics Subject Classification 20G40, 20D06.

The first author was partially supported by a Maclaurin Fellowship from the New Zealand Institute of Mathematics and its Applications. The second author was partially supported by the Marsden Fund of New Zealand via grant UOA412. We thank the referee for helpful comments and criticism of this work.

Received November 18, 2005; revised September 27, 2006; published online July 27, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.