Black Box Exceptional Groups of Lie Type
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 365, Number 9, September 2013, Pages 4895–4931 S 0002-9947(2013)05822-9 Article electronically published on May 28, 2013 BLACK BOX EXCEPTIONAL GROUPS OF LIE TYPE W. M. KANTOR AND K. MAGAARD Abstract. If a black box group is known to be isomorphic to an exceptional 2 simple group of Lie type of (twisted) rank > 1, other than any F4(q), over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism. In view of its timing, this algorithm yields an upgrade of all known nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the input group has no composition factor isomorphic 2 2 to any group F4(q)or G2(q). 1. Introduction In a number of algorithmic settings it is essential to take a permutation group or matrix group that is known (probably) to be simple and to produce an explicit isomorphism with an explicitly defined simple group, such as a group of matrices ([LG, KS1, Ka3] contain background on this and many related questions). This has been accomplished for the much more general setting of black box classical groups in [KS1, Br1, Br2, Br3, BrK1, BrK2, LMO] (starting with the groups PSL(d, 2) in [CFL]). Black box alternating groups are dealt with in [BLNPS]. In this paper we consider this identification question for black box exceptional groups of Lie type. Note that the name of the group can be found quickly using Monte Carlo algorithms in suitable settings [BKPS, KS3, KS4, LO].
[Show full text]