Constructive recognition of classical groups in their natural representation.

DOI10.1016/S0747-7171(02)00132-3MaRDI QIDQ1426140zbMATH OpenFDO

Authors Peter A. Brooksbank

Publication date 14 March 2004

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

simple groupsmatrix groupsconstructive recognitionLas Vegas algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• scientific article; zbMATH DE number 1004941
• Constructive recognition algorithms of classical groups in GAP
• Effective black-box constructive recognition of classical groups.
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Constructive recognition of classical groups in even characteristic.

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 1187223 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 682071 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• A Recognition Algorithm For Classical Groups Over Finite Fields
• A Recognition Algorithm for Special Linear Groups
• A constructive recognition algorithm for the matrix group \(\Omega(d,q)\).
• Black box classical groups.
• Fast recognition of classical groups over large fields
• Generating random elements of a finite group
• Recognising Tensor Products of Matrix Groups
• Testing matrix groups for primitivity
• The Rank 3 Permutation Representations of the Finite Classical Groups
• The computational matrix group project.
• Two-graphs and doubly transitive groups

Cited in

(25)

• Constructive homomorphisms for classical groups.
• Black box exceptional groups of Lie type. II.
• Effective black-box constructive recognition of classical groups.
• On the twisted modules for finite matrix groups
• Constructive recognition of classical groups in even characteristic.
• Certain classical groups are not well-defined
• Constructive recognition algorithms of classical groups in GAP
• Fast recognition of classical groups over large fields
• RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
• Recognition of finite exceptional groups of Lie type.
• Fast constructive recognition of black box symplectic groups.
• Recognising the small Ree groups in their natural representations.
• A new method for recognising Suzuki groups
• Presentations on standard generators for classical groups
• Intersecting two classical groups.
• Fast constructive recognition of black box orthogonal groups.
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• Algorithms in linear algebraic groups
• Black box exceptional groups of Lie type.
• Constructive recognition of classical groups in odd characteristic.
• CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
• On intersections of classical groups
• Fast Constructive Recognition of Black-Box Unitary Groups
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Constructive recognition of classical groups in their natural representation.

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