Effective black-box constructive recognition of classical groups.

DOI10.1016/j.jalgebra.2014.08.039zbMath1316.20053OpenAlexW2047176516MaRDI QIDQ468719

E. A. O'Brien, Heiko Dietrich, Charles R. Leedham-Green

Publication date: 7 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.08.039

zbMATH Keywords

classical groupsefficient algorithmsstandard generatorslinear groups over finite fieldsconstructive recognitionLas Vegas algorithmscomputational group theoryblack-box algorithmsmatrix recognition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Lengths of involutions in finite Coxeter groups, Constructing composition factors for a linear group in polynomial time, Recognition of finite exceptional groups of Lie type, Presentations on standard generators for classical groups, A note on involution centralizers in black box groups

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The probability of generating a finite simple group.
• Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
• Generation of finite classical groups by pairs of elements with large fixed point spaces.
• A practical model for computation with matrix groups.
• Recognising simplicity of black-box groups by constructing involutions and their centralisers.
• Constructive recognition of classical groups in odd characteristic.
• Finding involutions in finite Lie type groups of odd characteristic.
• Fast constructive recognition of black box symplectic groups.
• Estimating proportions of elements in finite groups of Lie type.
• On the minimal degrees of projective representations of the finite Chevalley groups
• Random walks on finite groups with few random generators
• The Magma algebra system. I: The user language
• An improved method for generating the centralizer of an involution
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
• Constructive recognition of classical groups in even characteristic.
• Constructive recognition of \(\text{SL}_3(q)\).
• Fast constructive recognition of black box orthogonal groups.
• The probability of generating a finite classical group
• Black box classical groups
• Taking roots over high extensions of finite fields
• On the Number ofp-Regular Elements in Finite Simple Groups
• Presentations of finite simple groups: A quantitative approach
• Involutions in Chevalley groups over fields of even order
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Fast Constructive Recognition of Black-Box Unitary Groups
• Generating random elements of a finite group
• ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS
• RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Constructive Membership Testing in Black-Box Classical Groups