A Recognition Algorithm for Special Linear Groups
This paper deals with the following question: Suppose \(X\) is a set of non-singular \(d\times d\)-matrices in \(G = GL(d,q)\). Is there an efficient algorithm to decide whether \(S = SL(d,q)\) is a subgroup of \(\langle X\rangle\)? This problem is related to a similar question where \(G\) is replaced by \(Sym(n)\) and \(S\) by \(Alt(n)\) [see \textit{P. Neumann}, Berechnungen in Gruppen (Lect. Notes, ETH Zürich 1987)]. The paper splits into a group theoretic part and a part on computations. In the first part subgroups of \(G\) are determined which contain irreducible and nearly irreducible elements. Here an element is called nearly irreducible if it decomposes the underlying \(d\)-space into two invariant, irreducible spaces of dimensions 1 and \(d-1\). These results overlap in part with some work of the reviewer [Rend. Semin. Mat. Univ. Padova 77, 69-113 (1987; Zbl 0624.20008)]. However the methods used in the paper under review are completely different. Main ingredient is \textit{M. Aschbacher}'s description of subgroups of \(GL(d,q)\) [in Invent. Math. 76, 469-514 (1984; Zbl 0537.20023)]. Together with a detailed study of the action of irreducible and nearly irreducible elements this yields a precise list of groups \(\langle X\rangle\) as above. In part two of the paper an outline for the explicit algorithm of a test on the inclusion of \(S\) in \(\langle X\rangle\) is given. In the first part of this algorithm it is described how suitable irreducible \(x\) and nearly irreducible matrices \(y\) are detected in a given set \(X\). In the second part special procedures are explained which detect groups \(\langle x,y\rangle\) not containing \(S\). The paper also contains a discussion on a priori estimates on the size of \(X\) to guarantee with probability \(1- \varepsilon\) the existence of \(S\). Moreover the complexity of this problem is discussed. Thus far the authors give no practical implementation of their algorithm but promise to do so.
- 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.
- Algorithms for matrix groups and the Tits alternative
- Deciding finiteness for matrix groups over function fields
- Prime power graphs for groups of Lie type
- Tensor products are projective geometries
- A theorem on random matrices and some applications
- Constructive recognition of classical groups in their natural representation.
- Maximal independent generating sets of the symmetric group
- Finite affine groups: cycle indices, Hall-Littlewood polynomials, and probabilistic algorithms
- Recognising tensor-induced matrix groups.
- Subgroups of \(\text{GL}_n(q)\) which fix sublattices of the subspace lattice
- Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
- Groups with the basis property.
- On cyclotomic schemes over finite near-fields
- A computer-assisted analysis of some matrix groups.
- Fast constructive recognition of black box orthogonal groups.
- Random matrix theory over finite fields
- Black box exceptional groups of Lie type.
- Algorithms to identify abundant p-singular elements in finite classical groups.
- Abundant \(p\)-singular elements in finite classical groups.
- Algorithmic Recognition of Group Actions on Orbitals
- scientific article; zbMATH DE number 1004930 (Why is no real title available?)
- The finite simple groups with at most two fusion classes of every order
- Irreducible representations of finite classical groups containing matrices with simple spectra
- An Algorithm for Recognising the Exterior Square of a Multiset
- A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
- 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
- An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
- Irreducibility testing of finite nilpotent linear groups.
- Computational group theory. Abstracts from the workshop held June 1--6, 2025
- Finite simple groups have many classes of p-elements
- Computational group theory: bedrock and new frontiers
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.
- Power series coefficients for probabilities in finite classical groups
- Geometric families of 4-dimensional Galois representations with generically large images
- Estimating proportions of elements in finite 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)
