2013/10/10 by Martin W. Liebeck, Liebeck, Martin W., E. A. O’Brien +2
Computer Science · Mathematics · #20C20 #20C40 #Advanced Algebra and Geometry #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #math.GR #msc:20C20 #msc:20C40
paper · pdf · doi:10.48550/arxiv.1310.2978
openalex publication_date 2013/10/10 · arxiv created 2014/09/02 · arxiv updated 2014/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let q be a prime power and let G be an absolutely irreducible subgroup of GLd(F), where F is a finite field of the same characteristic as \Fq, the field of q elements. Assume that G ≅ G(q), a quasisimple group of exceptional Lie type over \Fq which is neither a Suzuki nor a Ree group. We present a Las Vegas algorithm that constructs an isomorphism from G to the standard copy of G(q). If G \not≅ 3 D4(q) with q even, then the algorithm runs in polynomial time, subject to the existence of a discrete log oracle.