Recognising the Suzuki groups in their natural representations

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.jalgebra.2006.02.010

Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q), where q = 2^{2m + 1} for some m > 0, in their natural representations of degree 4. It is a Las Vegas algorithm with running time O{log(q)} field operations, and a preprocessing step with running time O{log(q) loglog(q)} field operations. The latter step needs an oracle for the discrete logarithm problem in GF(q). We also produce a recognition algorithm for Sz(q) = . This is a Las Vegas algorithm with running time O{|X|^2} field operations. Finally, we give a Las Vegas algorithm that, given ^h = Sz(q) for some h in GL(4, q), finds some g such that ^g = Sz(q). The running time is O{log(q) loglog(q) + |X|} field operations. Implementations of the algorithms are available for the computer system MAGMA.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Recognising the Suzuki groups in their natural representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recognising the Suzuki groups in their natural representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognising the Suzuki groups in their natural representations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-248086

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.