A Recognition Algorithm For Classical Groups Over Finite Fields

DOI10.1112/S0024611598000422zbMath0893.20035OpenAlexW2072053864WikidataQ56988112 ScholiaQ56988112MaRDI QIDQ4354309

Cheryl E. Praeger, Alice C. Niemeyer

Publication date: 16 September 1997

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

Full work available at URL: https://doi.org/10.1112/s0024611598000422

zbMATH Keywords

performanceclassical groupsspecial linear groupsprobability estimatesrandomised algorithmsprimitive prime divisor elementsmatrix groups over finite fields

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Generators, relations, and presentations of groups (20F05) Algebraic systems of matrices (15A30) Software, source code, etc. for problems pertaining to group theory (20-04) Classical groups (11E57)

Related Items

Prime power graphs for groups of Lie type, ALGORITHMS TO IDENTIFY ABUNDANTp-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS, Tensor products are projective geometries, On finite groups satisfying the permutizer condition, Gaussian elimination in unitary groups with an application to cryptography, Fast Constructive Recognition of Black-Box Unitary Groups, Abundant \(p\)-singular elements in finite classical groups., Invariable generation and the Chebotarev invariant of a finite group., Abelian quotients and orbit sizes of linear groups, Strong involutions in finite special linear groups of odd characteristic, On intersections of classical groups, Constructive recognition of classical groups in even characteristic., Prime divisors in polynomial orbits over function fields, PRIMITIVE PRIME DIVISORS AND THE TH CYCLOTOMIC POLYNOMIAL, Constructive recognition of classical groups in their natural representation., Effective black-box constructive recognition of classical groups., Constructive membership in black-box groups, Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture, A practical model for computation with matrix groups., Random matrix theory over finite fields, On flag-transitive \(2\)-\((v,k,2)\) designs, Pairwise transitive 2-designs, A computer-assisted analysis of some matrix groups., Representations, commutative algebra, and Hurwitz groups., Estimating proportions of elements in finite groups of Lie type., Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements, Large element orders and the characteristic of Lie-type simple groups., Constructive recognition of classical groups in odd characteristic., Transitive decompositions of graph products: rank 3 grid type, MINIMAL IRREDUCIBILITY AND THE UNIPOTENT CHARACTERS OF GROUPS OF TYPE B_m AND C_m, Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field, On the Number ofp-Regular Elements in Finite Simple Groups, Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules., Transitive subgroups of primitive permutation groups, DETERMINING ASCHBACHER CLASSES USING CHARACTERS, Black-box recognition of finite simple groups of Lie type by statistics of element orders