论文信息 - A new method for recognising Suzuki groups

A new method for recognising Suzuki groups

Abstract We present a new algorithm for constructive recognition of the Suzuki groups in their natural representations. The algorithm runs in Las Vegas polynomial time given a discrete logarithm oracle. An implementation is available in the Magma computer algebra system.

Henrik Bäärnhielm | John N. Bray | J. Bray | Henrik Bäärnhielm

[1] Igor Pak,et al. The product replacement algorithm is polynomial , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2] John N. Bray. An improved method for generating the centralizer of an involution , 2000 .

[3] Henrik Bäärnhielm,et al. Recognising the Suzuki groups in their natural representations , 2006, ArXiv.

[4] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .

[5] Henrik Bäärnhielm,et al. Algorithmic problems in twisted groups of Lie type , 2008, ArXiv.

[6] C. R. Leedham-Green,et al. Constructive recognition of classical groups in odd characteristic , 2007 .

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

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

[9] Scott H. Murray,et al. Generating random elements of a finite group , 1995 .

[10] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[11] Derek F. Holt,et al. A practical model for computation with matrix groups , 2015, J. Symb. Comput..

[12] Joachim von zur Gathen,et al. Modern Computer Algebra (3. ed.) , 2003 .