Black box classical groups

DOI10.1090/memo/0708zbMath1053.20045OpenAlexW1969754062MaRDI QIDQ2704686

Seress, Ákos, William M. Kantor

Publication date: 9 July 2002

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/0708

zbMATH Keywords

classical groupsLas Vegas algorithmsblack box groupsnearly linear time algorithmsMonte Carlo permutation group algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Randomized algorithms (68W20)

Related Items (27)

A black-box group algorithm for recognizing finite symmetric and alternating groups, I ⋮ Prime power graphs for groups of Lie type ⋮ Computing in groups of Lie type ⋮ Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) ⋮ Computing maximal subgroups of finite groups. ⋮ Gaussian elimination in unitary groups with an application to cryptography ⋮ Constructive recognition of classical groups in even characteristic. ⋮ Unnamed Item ⋮ Constructive recognition of classical groups in their natural representation. ⋮ Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\). ⋮ Effective black-box constructive recognition of classical groups. ⋮ Black box exceptional groups of Lie type. II. ⋮ A practical model for computation with matrix groups. ⋮ On the twisted modules for finite matrix groups ⋮ Constructive recognition of \(\text{SL}_3(q)\). ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Fast constructive recognition of black box symplectic groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Presentations of finite simple groups: A quantitative approach ⋮ Fast constructive recognition of black box orthogonal groups. ⋮ Recognition of finite exceptional groups of Lie type ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ Short presentations for three-dimensional unitary groups. ⋮ Presentations on standard generators for classical groups ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ Constructive recognition of classical groups in odd characteristic. ⋮ Black box exceptional groups of Lie type

This page was built for publication: Black box classical groups