论文信息 - Constructive recognition of a black box group isomorphic to GL(n,2)

Constructive recognition of a black box group isomorphic to GL(n,2)

A Monte Carlo algorithm is presented for constructing the natural representation of a group G that is known to be isomorphic to GL(n, 2). The complexity parameters are the natural dimension n and the storage space required to represent an element of G. What is surprising about this result is that both the data structure used to compute the isomorphism and each invocation of the isomorphism require polynomial time complexity. The ultimate goal is to eventually extend this result to the larger question of constructing the natural representation of classical groups. Extensions of the methods developed in this paper are discussed as well as open questions.

[1] Cheryl E. Praeger,et al. Implementing a recognition algorithm for classical groups , 1995, Groups and Computation.

[2] László Babai,et al. Las Vegas algorithms for matrix groups , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3] Robert Beals,et al. Towards polynomial time algorithms for matrix groups , 1995, Groups and Computation.

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

[5] Charles R. Leedham-Green,et al. Calculating the order of an invertible matrix , 1995, Groups and Computation.

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

[7] Charles R. Leedham-Green,et al. A non-constructive recognition algorithm for the special linear and other classical groups , 1995, Groups and Computation.