Probabilistic recognition of orthogonal and symplectic groups

MaRDI QIDQ2759616zbMATH OpenFDO

Authors Christine Altseimer, Alexandre V. Borovik

Publication date 7 May 2002

zbMATH Keywords

Monte Carlo algorithmsorthogonal groupspolynomial time algorithmssymplectic groups

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1004941
• Fast constructive recognition of black box symplectic groups.
• scientific article; zbMATH DE number 1004930
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Fast constructive recognition of black box orthogonal groups.

Cited in

(10)

• Prime power graphs for groups of Lie type
• Strong involutions in finite special linear groups of odd characteristic
• Regular semisimple elements and involutions in finite general linear groups of odd characteristic.
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• A note on computing involution centralizers.
• Algorithmic Recognition of Group Actions on Orbitals
• Black box exceptional groups of Lie type. II.
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Recognising simplicity of black-box groups by constructing involutions and their centralisers.
• Fast constructive recognition of black box symplectic groups.

This page was built for publication: Probabilistic recognition of orthogonal and symplectic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759616)