A Recognition Algorithm for Special Linear Groups

DOI10.1112/PLMS/S3-65.3.555zbMATH Open0770.20010OpenAlexW2021337234MaRDI QIDQ4024980FDOQ4024980

Authors Peter M. Neumann, Cheryl E. Praeger 

Publication date 18 February 1993

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/plms/s3-65.3.555

zbMATH Keywords

complexityefficient algorithmssubgroups\(GL(d,q)\)\(SL(d,q)\)nearly irreducible elementsnon-singular \(d\times d\)-matrices

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Linear algebraic groups over finite fields (20G40) Representations of finite groups of Lie type (20C33) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• scientific article; zbMATH DE number 1187223
• scientific article; zbMATH DE number 1004930
• An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
• A Recognition Algorithm For Classical Groups Over Finite Fields
• scientific article; zbMATH DE number 1370596
• Algorithms in linear algebraic groups
• scientific article; zbMATH DE number 1004941
• scientific article; zbMATH DE number 665470
• Recognition of some linear groups over the binary field by the spectrum.
• Algorithms for linear groups of finite rank.

Cited In (36)

• Maximal independent generating sets of the symmetric group
• On cyclotomic schemes over finite near-fields
• Fast constructive recognition of black box orthogonal groups.
• Abundant \(p\)-singular elements in finite classical groups.
• Subgroups of \(\text{GL}_n(q)\) which fix sublattices of the subspace lattice
• A computer-assisted analysis of some matrix groups.
• Black box exceptional groups of Lie type.
• Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms
• Estimating proportions of elements in finite groups of Lie type.
• A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
• Power series coefficients for probabilities in finite classical groups
• Generating random elements of a finite group
• A theorem on random matrices and some applications
• Irreducible representations of finite classical groups containing matrices with simple spectra
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Fast Constructive Recognition of Black-Box Unitary Groups
• An Algorithm for Recognising the Exterior Square of a Multiset
• Groups with the basis property.
• Tensor products are projective geometries
• RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
• Deciding finiteness for matrix groups over function fields
• CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
• Algorithms to identify abundant \(p\)-singular elements in finite classical groups.
• Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.
• An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
• Irreducibility testing of finite nilpotent linear groups.
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Algorithms for matrix groups and the Tits alternative
• Constructive recognition of classical groups in their natural representation.
• Geometric families of 4-dimensional Galois representations with generically large images
• Algorithmic Recognition of Group Actions on Orbitals
• The finite simple groups with at most two fusion classes of every order
• Random matrix theory over finite fields
• Recognising tensor-induced matrix groups.
• Prime power graphs for groups of Lie type

This page was built for publication: A Recognition Algorithm for Special Linear Groups

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