An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups

DOI10.1080/10586458.1992.10504262zbMath0790.20001OpenAlexW2083257389MaRDI QIDQ5285866

Derek F. Holt, Sarah Rees

Publication date: 29 June 1993

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/233010

zbMATH Keywords

generatorsrandom elementsspecial linear groupNeumann-Praeger algorithm\(GAP\) system

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) Simple groups: alternating groups and groups of Lie type (20D06)

Related Items

Cutoff for product replacement on finite groups ⋮ Maximal independent generating sets of the symmetric group

Uses Software

• GAP

Cites Work

• On the maximal subgroups of the finite classical groups
• A Recognition Algorithm for Special Linear Groups