Abstract We present a Las Vegas polynomial-time algorithm that takes as input a subgroup of GL ( d , F q ) and, subject to the existence of certain oracles,… Click to show full abstract
Abstract We present a Las Vegas polynomial-time algorithm that takes as input a subgroup of GL ( d , F q ) and, subject to the existence of certain oracles, determines its composition factors, provided that none of those factors is isomorphic to one of B 2 2 ( 2 2 k + 1 ) , F 4 2 ( 2 2 k + 1 ) , D 4 3 ( 2 k ) , or G 2 2 ( 3 2 k + 1 ) , for any k.
               
Click one of the above tabs to view related content.