Black-box recognition of finite simple groups of Lie type by statistics of element orders

Given a black-box group G isomorphic to some finite simple group of Lie type and the characteristic of G, we compute the standard name of G by a Monte Carlo algorithm. The running time is polynomial in the input length and in the time requirement for the group operations in G. The algorithm chooses a relatively small number of (nearly) uniformly distributed random elements of G, and examines the divisibility of the orders of these elements by certain primitive prime divisors. We show that the divisibility statistics determine G, except that we cannot distinguish the groups PWð2mþ 1; qÞ and PSpð2m; qÞ in this manner when q is odd and md 3. These two groups can, however, be distinguished by using an algorithm of Altseimer and

[1]  William M. Kantor,et al.  On the Probability That a Group Element is p-Singular , 1995 .

[2]  E. Artin.  The orders of the classical simple groups , 1955 .

[3]  T. A. Springer.  Conjugacy classes in algebraic groups , 1986 .

[4]  K. Zsigmondy,et al.  Zur Theorie der Potenzreste , 1892 .

[5]  William M. Kantor,et al.  Prime Power Graphs for Groups of Lie Type , 2002 .

[6]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[7]  László Babai,et al.  Local expansion of vertex-transitive graphs and random generation in finite groups , 1991, STOC '91.

[8]  R. Lyons,et al.  Composition Factors from the Group Ring and Artin's Theorem on Orders of Simple Groups , 1990 .

[9]  Peter A. Brooksbank.  A Constructive Recognition Algorithm for the Matrix Group Ω(d, q) , 2004 .

[10]  R. Carter.  Centralizers of Semisimple Elements in the Finite Classical Groups , 1981 .

[11]  William M. Kantor,et al.  On constructive recognition of a black box PSL , 2001 .

[12]  A. Borovik.  Probabilistic Recognition of Orthogonal and Symplectic Groups : Corrections , 2001 .

[13]  J. Conway,et al.  ATLAS of Finite Groups , 1985 .

[14]  T. A. Springer,et al.  Seminar on Algebraic Groups and Related Finite Groups , 1970 .

[15]  Martin W. Liebeck,et al.  The Subgroup Structure of the Finite Classical Groups , 1990 .

[16]  C. Leedham-Green,et al.  The Atlas of Finite Groups - Ten Years on: A constructive recognition algorithm for the special linear group , 1998 .

[17]  László Babai,et al.  Randomization in group algorithms: Conceptual questions , 1995, Groups and Computation.

[18]  L. Babai,et al.  Groups St Andrews 1997 in Bath, I: A polynomial-time theory of black box groups I , 1999 .

[19]  I. G. MacDonald,et al.  Lectures on Lie Groups and Lie Algebras: Simple groups of Lie type , 1995 .

[20]  Cheryl E. Praeger,et al.  A Recognition Algorithm For Classical Groups Over Finite Fields , 1998 .

[21]  A. Borel.  Properties and linear representations of Chevalley groups , 1970 .

[22]  C. R. Leedham-Green,et al.  The computational matrix group project , 2001 .

[23]  Cheryl E. Praeger,et al.  A Recognition Algorithm for Special Linear Groups , 1992 .

[24]  William M. Kantor,et al.  Black Box Classical Groups , 2001 .